java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 05:32:30,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 05:32:30,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 05:32:30,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 05:32:30,721 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 05:32:30,722 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 05:32:30,723 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 05:32:30,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 05:32:30,726 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 05:32:30,727 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 05:32:30,728 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 05:32:30,728 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 05:32:30,729 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 05:32:30,730 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 05:32:30,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 05:32:30,732 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 05:32:30,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 05:32:30,735 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 05:32:30,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 05:32:30,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 05:32:30,738 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 05:32:30,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 05:32:30,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 05:32:30,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 05:32:30,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 05:32:30,741 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 05:32:30,742 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 05:32:30,742 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 05:32:30,743 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 05:32:30,743 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 05:32:30,744 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 05:32:30,744 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-13 05:32:30,754 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 05:32:30,754 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 05:32:30,755 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 05:32:30,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 05:32:30,756 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 05:32:30,756 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 05:32:30,756 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 05:32:30,756 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 05:32:30,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 05:32:30,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 05:32:30,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 05:32:30,757 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 05:32:30,757 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 05:32:30,757 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 05:32:30,757 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 05:32:30,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 05:32:30,758 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 05:32:30,758 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 05:32:30,758 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 05:32:30,758 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 05:32:30,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 05:32:30,758 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 05:32:30,759 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 05:32:30,759 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 05:32:30,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 05:32:30,801 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 05:32:30,806 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 05:32:30,808 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 05:32:30,808 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 05:32:30,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,185 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcd9d074b9 [2018-04-13 05:32:31,310 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 05:32:31,311 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 05:32:31,311 INFO L168 CDTParser]: Scanning lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,319 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 05:32:31,319 INFO L215 ultiparseSymbolTable]: [2018-04-13 05:32:31,319 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 05:32:31,320 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,320 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__push ('push') in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,320 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__pop ('pop') in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,320 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 05:32:31,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clockid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____daddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clockid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,320 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_int in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_cond_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,321 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____loff_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__suseconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____useconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_mask in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__wchar_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_long in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__nlink_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,322 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,323 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uint in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,323 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,323 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ssize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,323 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sigset_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,323 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_once_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,323 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__dev_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,323 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,323 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_spinlock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,323 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__id_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,323 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,324 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_short in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,324 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ulong in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,324 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__gid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,324 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__S in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,324 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,324 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ldiv_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,324 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,324 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ino_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,324 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____swblk_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrierattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__register_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int8_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____dev_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____time_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__daddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ushort in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,325 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__loff_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,326 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t4 in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,326 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,326 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,326 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t1 in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,326 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_condattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,326 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,326 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____WAIT_STATUS in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,326 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,326 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blksize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____qaddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__div_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__garbage in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__time_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____suseconds_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutex_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_set in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,327 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__lldiv_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__mode_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc1 in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_short in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc4 in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____intptr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_key_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____caddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__size_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,328 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlock_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__caddr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blksize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____mode_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__sigset_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_char in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__timer_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_long in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int16_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__off_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlockattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,329 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsfilcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ssize_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pthread_list_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____socklen_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____nlink_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_attr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int32_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_char in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____gid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sig_atomic_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrier_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____id_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x1 in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____quad_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fd_mask in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt64_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,330 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x4 in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pid_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsblkcnt_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____timer_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutexattr_t in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,331 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int in lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:31,344 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcd9d074b9 [2018-04-13 05:32:31,347 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 05:32:31,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 05:32:31,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 05:32:31,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 05:32:31,352 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 05:32:31,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:32:31" (1/1) ... [2018-04-13 05:32:31,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7704117e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31, skipping insertion in model container [2018-04-13 05:32:31,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:32:31" (1/1) ... [2018-04-13 05:32:31,365 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 05:32:31,387 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 05:32:31,521 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 05:32:31,559 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 05:32:31,566 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-13 05:32:31,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31 WrapperNode [2018-04-13 05:32:31,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 05:32:31,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 05:32:31,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 05:32:31,604 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 05:32:31,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31" (1/1) ... [2018-04-13 05:32:31,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31" (1/1) ... [2018-04-13 05:32:31,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31" (1/1) ... [2018-04-13 05:32:31,634 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31" (1/1) ... [2018-04-13 05:32:31,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31" (1/1) ... [2018-04-13 05:32:31,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31" (1/1) ... [2018-04-13 05:32:31,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31" (1/1) ... [2018-04-13 05:32:31,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 05:32:31,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 05:32:31,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 05:32:31,654 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 05:32:31,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 05:32:31,744 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 05:32:31,744 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 05:32:31,744 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-13 05:32:31,744 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-13 05:32:31,744 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 05:32:31,744 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 05:32:31,744 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 05:32:31,744 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 05:32:31,745 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 05:32:31,745 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 05:32:31,745 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 05:32:31,745 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 05:32:31,745 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 05:32:31,745 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 05:32:31,745 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 05:32:31,745 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 05:32:31,745 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 05:32:31,745 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 05:32:31,746 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 05:32:31,746 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 05:32:31,746 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 05:32:31,746 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 05:32:31,746 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 05:32:31,746 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 05:32:31,746 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 05:32:31,746 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 05:32:31,746 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 05:32:31,746 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 05:32:31,747 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 05:32:31,748 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 05:32:31,749 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 05:32:31,750 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 05:32:31,751 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 05:32:31,752 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 05:32:31,752 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 05:32:31,752 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 05:32:31,752 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 05:32:31,752 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 05:32:31,752 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 05:32:31,752 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 05:32:31,752 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 05:32:31,752 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 05:32:31,752 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 05:32:31,753 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 05:32:31,753 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 05:32:31,753 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 05:32:31,753 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-13 05:32:31,753 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 05:32:31,753 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 05:32:31,753 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 05:32:31,753 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-13 05:32:31,753 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 05:32:31,753 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 05:32:31,754 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 05:32:31,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 05:32:31,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 05:32:31,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 05:32:31,754 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 05:32:32,070 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 05:32:32,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:32:32 BoogieIcfgContainer [2018-04-13 05:32:32,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 05:32:32,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 05:32:32,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 05:32:32,073 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 05:32:32,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:32:31" (1/3) ... [2018-04-13 05:32:32,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280a0acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:32:32, skipping insertion in model container [2018-04-13 05:32:32,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:32:31" (2/3) ... [2018-04-13 05:32:32,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280a0acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:32:32, skipping insertion in model container [2018-04-13 05:32:32,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:32:32" (3/3) ... [2018-04-13 05:32:32,075 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-04-13 05:32:32,081 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 05:32:32,085 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-13 05:32:32,107 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 05:32:32,108 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 05:32:32,108 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 05:32:32,108 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 05:32:32,108 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 05:32:32,108 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 05:32:32,108 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 05:32:32,108 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 05:32:32,108 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 05:32:32,108 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 05:32:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-04-13 05:32:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-13 05:32:32,123 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:32,123 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:32,124 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-13 05:32:32,126 INFO L82 PathProgramCache]: Analyzing trace with hash 764612502, now seen corresponding path program 1 times [2018-04-13 05:32:32,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:32,128 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:32,156 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:32,156 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:32,191 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:32,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:32,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 05:32:32,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-13 05:32:32,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-13 05:32:32,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-13 05:32:32,240 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2018-04-13 05:32:32,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:32,255 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2018-04-13 05:32:32,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-13 05:32:32,256 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-04-13 05:32:32,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:32,264 INFO L225 Difference]: With dead ends: 78 [2018-04-13 05:32:32,265 INFO L226 Difference]: Without dead ends: 75 [2018-04-13 05:32:32,266 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-13 05:32:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-13 05:32:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-13 05:32:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-13 05:32:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2018-04-13 05:32:32,292 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 9 [2018-04-13 05:32:32,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:32,292 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2018-04-13 05:32:32,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-13 05:32:32,292 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2018-04-13 05:32:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 05:32:32,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:32,293 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:32,293 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-13 05:32:32,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2144181541, now seen corresponding path program 1 times [2018-04-13 05:32:32,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:32,293 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:32,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:32,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:32,312 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:32,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:32,336 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:32,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:32:32,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 05:32:32,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 05:32:32,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:32:32,338 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand 3 states. [2018-04-13 05:32:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:32,352 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2018-04-13 05:32:32,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 05:32:32,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-13 05:32:32,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:32,353 INFO L225 Difference]: With dead ends: 76 [2018-04-13 05:32:32,353 INFO L226 Difference]: Without dead ends: 76 [2018-04-13 05:32:32,354 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:32:32,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-13 05:32:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-04-13 05:32:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-13 05:32:32,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-04-13 05:32:32,357 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 12 [2018-04-13 05:32:32,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:32,357 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-04-13 05:32:32,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 05:32:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-04-13 05:32:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-13 05:32:32,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:32,358 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:32,358 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-13 05:32:32,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2142334499, now seen corresponding path program 1 times [2018-04-13 05:32:32,358 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:32,358 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:32,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:32,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:32,378 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:32,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:32,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:32:32,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 05:32:32,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 05:32:32,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:32:32,427 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 3 states. [2018-04-13 05:32:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:32,448 INFO L93 Difference]: Finished difference Result 134 states and 169 transitions. [2018-04-13 05:32:32,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 05:32:32,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-04-13 05:32:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:32,449 INFO L225 Difference]: With dead ends: 134 [2018-04-13 05:32:32,450 INFO L226 Difference]: Without dead ends: 134 [2018-04-13 05:32:32,450 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-13 05:32:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-13 05:32:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-04-13 05:32:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-13 05:32:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2018-04-13 05:32:32,458 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 12 [2018-04-13 05:32:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:32,458 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2018-04-13 05:32:32,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 05:32:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2018-04-13 05:32:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-13 05:32:32,459 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:32,459 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:32,459 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-13 05:32:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1987861526, now seen corresponding path program 1 times [2018-04-13 05:32:32,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:32,459 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:32,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:32,460 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:32,472 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:32,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:32,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 05:32:32,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 05:32:32,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 05:32:32,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 05:32:32,498 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand 3 states. [2018-04-13 05:32:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:32,548 INFO L93 Difference]: Finished difference Result 151 states and 209 transitions. [2018-04-13 05:32:32,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 05:32:32,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-04-13 05:32:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:32,550 INFO L225 Difference]: With dead ends: 151 [2018-04-13 05:32:32,550 INFO L226 Difference]: Without dead ends: 147 [2018-04-13 05:32:32,550 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-13 05:32:32,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-13 05:32:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2018-04-13 05:32:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-13 05:32:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 194 transitions. [2018-04-13 05:32:32,559 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 194 transitions. Word has length 13 [2018-04-13 05:32:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:32,559 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 194 transitions. [2018-04-13 05:32:32,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 05:32:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 194 transitions. [2018-04-13 05:32:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-13 05:32:32,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:32,560 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:32,560 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-13 05:32:32,560 INFO L82 PathProgramCache]: Analyzing trace with hash -990934181, now seen corresponding path program 1 times [2018-04-13 05:32:32,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:32,560 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:32,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:32,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:32,569 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:32,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:32,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 05:32:32,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:32:32,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:32:32,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:32:32,594 INFO L87 Difference]: Start difference. First operand 137 states and 194 transitions. Second operand 5 states. [2018-04-13 05:32:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:32,666 INFO L93 Difference]: Finished difference Result 259 states and 361 transitions. [2018-04-13 05:32:32,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 05:32:32,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-13 05:32:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:32,669 INFO L225 Difference]: With dead ends: 259 [2018-04-13 05:32:32,669 INFO L226 Difference]: Without dead ends: 259 [2018-04-13 05:32:32,669 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-13 05:32:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-13 05:32:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 228. [2018-04-13 05:32:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-04-13 05:32:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 340 transitions. [2018-04-13 05:32:32,684 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 340 transitions. Word has length 15 [2018-04-13 05:32:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:32,684 INFO L459 AbstractCegarLoop]: Abstraction has 228 states and 340 transitions. [2018-04-13 05:32:32,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:32:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 340 transitions. [2018-04-13 05:32:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 05:32:32,685 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:32,685 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:32,685 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-13 05:32:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash -654467540, now seen corresponding path program 1 times [2018-04-13 05:32:32,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:32,686 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:32,686 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:32,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:32,695 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:32,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:32,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:32:32,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:32:32,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:32:32,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:32:32,717 INFO L87 Difference]: Start difference. First operand 228 states and 340 transitions. Second operand 4 states. [2018-04-13 05:32:32,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:32,811 INFO L93 Difference]: Finished difference Result 390 states and 573 transitions. [2018-04-13 05:32:32,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:32:32,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 05:32:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:32,815 INFO L225 Difference]: With dead ends: 390 [2018-04-13 05:32:32,815 INFO L226 Difference]: Without dead ends: 390 [2018-04-13 05:32:32,815 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:32:32,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-04-13 05:32:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 360. [2018-04-13 05:32:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-13 05:32:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 550 transitions. [2018-04-13 05:32:32,832 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 550 transitions. Word has length 16 [2018-04-13 05:32:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:32,833 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 550 transitions. [2018-04-13 05:32:32,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:32:32,833 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 550 transitions. [2018-04-13 05:32:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 05:32:32,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:32,833 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:32,834 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-13 05:32:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash -654467539, now seen corresponding path program 1 times [2018-04-13 05:32:32,834 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:32,834 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:32,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:32,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:32,845 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:32,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:32,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 05:32:32,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:32:32,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:32:32,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:32:32,870 INFO L87 Difference]: Start difference. First operand 360 states and 550 transitions. Second operand 4 states. [2018-04-13 05:32:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:32,983 INFO L93 Difference]: Finished difference Result 489 states and 720 transitions. [2018-04-13 05:32:32,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 05:32:32,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 05:32:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:32,985 INFO L225 Difference]: With dead ends: 489 [2018-04-13 05:32:32,985 INFO L226 Difference]: Without dead ends: 489 [2018-04-13 05:32:32,985 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:32:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-04-13 05:32:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 462. [2018-04-13 05:32:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-04-13 05:32:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 698 transitions. [2018-04-13 05:32:32,994 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 698 transitions. Word has length 16 [2018-04-13 05:32:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:32,994 INFO L459 AbstractCegarLoop]: Abstraction has 462 states and 698 transitions. [2018-04-13 05:32:32,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:32:32,994 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 698 transitions. [2018-04-13 05:32:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 05:32:32,995 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:32,995 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:32,995 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-13 05:32:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2111148230, now seen corresponding path program 1 times [2018-04-13 05:32:32,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:32,995 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:32,995 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:32,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:32,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:33,001 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:33,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:33,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 05:32:33,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:32:33,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:32:33,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:32:33,037 INFO L87 Difference]: Start difference. First operand 462 states and 698 transitions. Second operand 5 states. [2018-04-13 05:32:33,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:33,085 INFO L93 Difference]: Finished difference Result 865 states and 1229 transitions. [2018-04-13 05:32:33,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 05:32:33,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-13 05:32:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:33,090 INFO L225 Difference]: With dead ends: 865 [2018-04-13 05:32:33,090 INFO L226 Difference]: Without dead ends: 865 [2018-04-13 05:32:33,090 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-13 05:32:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-04-13 05:32:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 830. [2018-04-13 05:32:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-04-13 05:32:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2018-04-13 05:32:33,117 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 16 [2018-04-13 05:32:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:33,118 INFO L459 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2018-04-13 05:32:33,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:32:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2018-04-13 05:32:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-13 05:32:33,119 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:33,119 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-13 05:32:33,119 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-13 05:32:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1464034702, now seen corresponding path program 1 times [2018-04-13 05:32:33,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:33,120 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:33,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:33,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:33,120 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:33,132 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:33,165 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-13 05:32:33,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:33,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:33,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:33,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:33,245 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-13 05:32:33,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:33,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-04-13 05:32:33,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 05:32:33,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 05:32:33,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 05:32:33,247 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 6 states. [2018-04-13 05:32:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:33,352 INFO L93 Difference]: Finished difference Result 1293 states and 1813 transitions. [2018-04-13 05:32:33,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 05:32:33,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-13 05:32:33,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:33,360 INFO L225 Difference]: With dead ends: 1293 [2018-04-13 05:32:33,360 INFO L226 Difference]: Without dead ends: 1293 [2018-04-13 05:32:33,361 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-13 05:32:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-04-13 05:32:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1222. [2018-04-13 05:32:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-04-13 05:32:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1746 transitions. [2018-04-13 05:32:33,394 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1746 transitions. Word has length 26 [2018-04-13 05:32:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:33,394 INFO L459 AbstractCegarLoop]: Abstraction has 1222 states and 1746 transitions. [2018-04-13 05:32:33,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 05:32:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1746 transitions. [2018-04-13 05:32:33,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 05:32:33,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:33,395 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-13 05:32:33,396 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-13 05:32:33,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1396165131, now seen corresponding path program 1 times [2018-04-13 05:32:33,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:33,396 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:33,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:33,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:33,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:33,407 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:33,431 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-13 05:32:33,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:33,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 05:32:33,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 05:32:33,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 05:32:33,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:32:33,433 INFO L87 Difference]: Start difference. First operand 1222 states and 1746 transitions. Second operand 5 states. [2018-04-13 05:32:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:33,497 INFO L93 Difference]: Finished difference Result 1826 states and 2685 transitions. [2018-04-13 05:32:33,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 05:32:33,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-13 05:32:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:33,506 INFO L225 Difference]: With dead ends: 1826 [2018-04-13 05:32:33,506 INFO L226 Difference]: Without dead ends: 1826 [2018-04-13 05:32:33,507 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-13 05:32:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-04-13 05:32:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1804. [2018-04-13 05:32:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2018-04-13 05:32:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2673 transitions. [2018-04-13 05:32:33,558 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2673 transitions. Word has length 27 [2018-04-13 05:32:33,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:33,558 INFO L459 AbstractCegarLoop]: Abstraction has 1804 states and 2673 transitions. [2018-04-13 05:32:33,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 05:32:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2673 transitions. [2018-04-13 05:32:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 05:32:33,559 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:33,560 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-13 05:32:33,560 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-13 05:32:33,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1008277157, now seen corresponding path program 1 times [2018-04-13 05:32:33,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:33,560 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:33,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:33,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:33,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:33,571 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:33,681 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-13 05:32:33,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:33,681 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:33,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:33,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:33,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:32:33,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2018-04-13 05:32:33,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:33,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:33,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:33,751 INFO L87 Difference]: Start difference. First operand 1804 states and 2673 transitions. Second operand 11 states. [2018-04-13 05:32:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:34,320 INFO L93 Difference]: Finished difference Result 956 states and 1213 transitions. [2018-04-13 05:32:34,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 05:32:34,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-13 05:32:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:34,322 INFO L225 Difference]: With dead ends: 956 [2018-04-13 05:32:34,323 INFO L226 Difference]: Without dead ends: 860 [2018-04-13 05:32:34,323 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2018-04-13 05:32:34,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-04-13 05:32:34,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 797. [2018-04-13 05:32:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-04-13 05:32:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1060 transitions. [2018-04-13 05:32:34,335 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1060 transitions. Word has length 31 [2018-04-13 05:32:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:34,336 INFO L459 AbstractCegarLoop]: Abstraction has 797 states and 1060 transitions. [2018-04-13 05:32:34,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:34,336 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1060 transitions. [2018-04-13 05:32:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 05:32:34,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:34,336 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-13 05:32:34,337 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-13 05:32:34,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1466399373, now seen corresponding path program 1 times [2018-04-13 05:32:34,337 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:34,337 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:34,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:34,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:34,338 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:34,345 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:34,461 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-13 05:32:34,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:34,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:34,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:34,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:34,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 05:32:34,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-13 05:32:34,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-04-13 05:32:34,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 05:32:34,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 05:32:34,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-13 05:32:34,529 INFO L87 Difference]: Start difference. First operand 797 states and 1060 transitions. Second operand 12 states. [2018-04-13 05:32:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:35,259 INFO L93 Difference]: Finished difference Result 1474 states and 1938 transitions. [2018-04-13 05:32:35,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 05:32:35,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-04-13 05:32:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:35,265 INFO L225 Difference]: With dead ends: 1474 [2018-04-13 05:32:35,266 INFO L226 Difference]: Without dead ends: 1466 [2018-04-13 05:32:35,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2018-04-13 05:32:35,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-04-13 05:32:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1122. [2018-04-13 05:32:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2018-04-13 05:32:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1488 transitions. [2018-04-13 05:32:35,306 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1488 transitions. Word has length 31 [2018-04-13 05:32:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:35,306 INFO L459 AbstractCegarLoop]: Abstraction has 1122 states and 1488 transitions. [2018-04-13 05:32:35,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 05:32:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1488 transitions. [2018-04-13 05:32:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 05:32:35,307 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:35,308 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-13 05:32:35,308 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-13 05:32:35,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1776763504, now seen corresponding path program 1 times [2018-04-13 05:32:35,308 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:35,308 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:35,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:35,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:35,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:35,320 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-13 05:32:35,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 05:32:35,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 05:32:35,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 05:32:35,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 05:32:35,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 05:32:35,354 INFO L87 Difference]: Start difference. First operand 1122 states and 1488 transitions. Second operand 4 states. [2018-04-13 05:32:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:35,388 INFO L93 Difference]: Finished difference Result 1131 states and 1500 transitions. [2018-04-13 05:32:35,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 05:32:35,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-04-13 05:32:35,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:35,392 INFO L225 Difference]: With dead ends: 1131 [2018-04-13 05:32:35,393 INFO L226 Difference]: Without dead ends: 1131 [2018-04-13 05:32:35,393 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 05:32:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-04-13 05:32:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1125. [2018-04-13 05:32:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2018-04-13 05:32:35,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1491 transitions. [2018-04-13 05:32:35,422 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1491 transitions. Word has length 38 [2018-04-13 05:32:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:35,423 INFO L459 AbstractCegarLoop]: Abstraction has 1125 states and 1491 transitions. [2018-04-13 05:32:35,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 05:32:35,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1491 transitions. [2018-04-13 05:32:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 05:32:35,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:35,424 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:35,424 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-13 05:32:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1816603918, now seen corresponding path program 1 times [2018-04-13 05:32:35,424 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:35,424 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:35,425 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:35,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:35,425 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:35,436 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:35,484 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-13 05:32:35,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:35,484 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:35,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:35,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:35,543 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-13 05:32:35,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:35,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-04-13 05:32:35,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:32:35,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:32:35,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:32:35,545 INFO L87 Difference]: Start difference. First operand 1125 states and 1491 transitions. Second operand 10 states. [2018-04-13 05:32:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:35,949 INFO L93 Difference]: Finished difference Result 2734 states and 3590 transitions. [2018-04-13 05:32:35,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:32:35,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-13 05:32:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:35,959 INFO L225 Difference]: With dead ends: 2734 [2018-04-13 05:32:35,959 INFO L226 Difference]: Without dead ends: 2734 [2018-04-13 05:32:35,959 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-04-13 05:32:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2018-04-13 05:32:36,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2363. [2018-04-13 05:32:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2018-04-13 05:32:36,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3129 transitions. [2018-04-13 05:32:36,011 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3129 transitions. Word has length 38 [2018-04-13 05:32:36,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:36,012 INFO L459 AbstractCegarLoop]: Abstraction has 2363 states and 3129 transitions. [2018-04-13 05:32:36,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:32:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3129 transitions. [2018-04-13 05:32:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 05:32:36,012 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:36,013 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-13 05:32:36,013 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-13 05:32:36,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2142437170, now seen corresponding path program 1 times [2018-04-13 05:32:36,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:36,013 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:36,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:36,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:36,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:36,048 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:36,087 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-13 05:32:36,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:36,087 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:36,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:36,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:36,140 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-13 05:32:36,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:36,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-04-13 05:32:36,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:32:36,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:32:36,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:32:36,142 INFO L87 Difference]: Start difference. First operand 2363 states and 3129 transitions. Second operand 10 states. [2018-04-13 05:32:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:36,359 INFO L93 Difference]: Finished difference Result 2436 states and 3194 transitions. [2018-04-13 05:32:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 05:32:36,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-04-13 05:32:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:36,369 INFO L225 Difference]: With dead ends: 2436 [2018-04-13 05:32:36,369 INFO L226 Difference]: Without dead ends: 2400 [2018-04-13 05:32:36,369 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-04-13 05:32:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-04-13 05:32:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2327. [2018-04-13 05:32:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2018-04-13 05:32:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3075 transitions. [2018-04-13 05:32:36,413 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3075 transitions. Word has length 42 [2018-04-13 05:32:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:36,413 INFO L459 AbstractCegarLoop]: Abstraction has 2327 states and 3075 transitions. [2018-04-13 05:32:36,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:32:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3075 transitions. [2018-04-13 05:32:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 05:32:36,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:36,414 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:36,414 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-13 05:32:36,415 INFO L82 PathProgramCache]: Analyzing trace with hash -211724275, now seen corresponding path program 1 times [2018-04-13 05:32:36,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:36,415 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:36,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:36,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:36,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:36,426 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:36,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-13 05:32:36,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:36,514 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:36,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:36,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-13 05:32:36,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:36,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-04-13 05:32:36,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-13 05:32:36,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-13 05:32:36,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-13 05:32:36,576 INFO L87 Difference]: Start difference. First operand 2327 states and 3075 transitions. Second operand 9 states. [2018-04-13 05:32:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:36,786 INFO L93 Difference]: Finished difference Result 2176 states and 2860 transitions. [2018-04-13 05:32:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-13 05:32:36,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2018-04-13 05:32:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:36,793 INFO L225 Difference]: With dead ends: 2176 [2018-04-13 05:32:36,793 INFO L226 Difference]: Without dead ends: 2176 [2018-04-13 05:32:36,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-04-13 05:32:36,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2018-04-13 05:32:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2118. [2018-04-13 05:32:36,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2118 states. [2018-04-13 05:32:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 2802 transitions. [2018-04-13 05:32:36,830 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 2802 transitions. Word has length 43 [2018-04-13 05:32:36,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:36,831 INFO L459 AbstractCegarLoop]: Abstraction has 2118 states and 2802 transitions. [2018-04-13 05:32:36,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-13 05:32:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 2802 transitions. [2018-04-13 05:32:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 05:32:36,832 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:36,832 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:36,832 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-13 05:32:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1766984159, now seen corresponding path program 1 times [2018-04-13 05:32:36,832 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:36,832 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:36,833 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:36,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:36,833 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:36,844 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:36,892 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-13 05:32:36,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:36,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:36,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:36,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:36,960 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-13 05:32:36,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:36,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-13 05:32:36,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:36,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:36,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:36,961 INFO L87 Difference]: Start difference. First operand 2118 states and 2802 transitions. Second operand 11 states. [2018-04-13 05:32:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:37,240 INFO L93 Difference]: Finished difference Result 2594 states and 3463 transitions. [2018-04-13 05:32:37,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:32:37,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-04-13 05:32:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:37,252 INFO L225 Difference]: With dead ends: 2594 [2018-04-13 05:32:37,252 INFO L226 Difference]: Without dead ends: 2594 [2018-04-13 05:32:37,253 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:32:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2018-04-13 05:32:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2510. [2018-04-13 05:32:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2510 states. [2018-04-13 05:32:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2510 states to 2510 states and 3370 transitions. [2018-04-13 05:32:37,298 INFO L78 Accepts]: Start accepts. Automaton has 2510 states and 3370 transitions. Word has length 54 [2018-04-13 05:32:37,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:37,298 INFO L459 AbstractCegarLoop]: Abstraction has 2510 states and 3370 transitions. [2018-04-13 05:32:37,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2510 states and 3370 transitions. [2018-04-13 05:32:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 05:32:37,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:37,300 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:37,300 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-13 05:32:37,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2029376545, now seen corresponding path program 1 times [2018-04-13 05:32:37,301 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:37,301 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:37,301 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:37,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:37,302 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:37,313 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:37,359 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-13 05:32:37,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:37,360 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:37,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:37,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-13 05:32:37,432 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:37,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-04-13 05:32:37,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 05:32:37,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 05:32:37,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 05:32:37,433 INFO L87 Difference]: Start difference. First operand 2510 states and 3370 transitions. Second operand 10 states. [2018-04-13 05:32:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:37,662 INFO L93 Difference]: Finished difference Result 2578 states and 3412 transitions. [2018-04-13 05:32:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:32:37,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-04-13 05:32:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:37,672 INFO L225 Difference]: With dead ends: 2578 [2018-04-13 05:32:37,672 INFO L226 Difference]: Without dead ends: 2476 [2018-04-13 05:32:37,672 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-04-13 05:32:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2018-04-13 05:32:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2440. [2018-04-13 05:32:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2440 states. [2018-04-13 05:32:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3236 transitions. [2018-04-13 05:32:37,719 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3236 transitions. Word has length 54 [2018-04-13 05:32:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:37,719 INFO L459 AbstractCegarLoop]: Abstraction has 2440 states and 3236 transitions. [2018-04-13 05:32:37,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 05:32:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3236 transitions. [2018-04-13 05:32:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-13 05:32:37,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:37,721 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:37,721 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-13 05:32:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash 473555497, now seen corresponding path program 1 times [2018-04-13 05:32:37,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:37,721 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:37,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:37,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:37,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:37,733 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-13 05:32:37,860 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:37,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:37,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:37,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-04-13 05:32:37,948 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:37,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-04-13 05:32:37,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 05:32:37,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 05:32:37,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-04-13 05:32:37,949 INFO L87 Difference]: Start difference. First operand 2440 states and 3236 transitions. Second operand 13 states. [2018-04-13 05:32:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:38,300 INFO L93 Difference]: Finished difference Result 2350 states and 3062 transitions. [2018-04-13 05:32:38,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:32:38,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-04-13 05:32:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:38,306 INFO L225 Difference]: With dead ends: 2350 [2018-04-13 05:32:38,306 INFO L226 Difference]: Without dead ends: 2283 [2018-04-13 05:32:38,306 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-04-13 05:32:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2018-04-13 05:32:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 1680. [2018-04-13 05:32:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-04-13 05:32:38,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2193 transitions. [2018-04-13 05:32:38,366 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2193 transitions. Word has length 57 [2018-04-13 05:32:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:38,366 INFO L459 AbstractCegarLoop]: Abstraction has 1680 states and 2193 transitions. [2018-04-13 05:32:38,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 05:32:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2193 transitions. [2018-04-13 05:32:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-13 05:32:38,367 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:38,368 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:38,368 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-13 05:32:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash 2017153842, now seen corresponding path program 1 times [2018-04-13 05:32:38,368 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:38,368 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:38,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:38,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:38,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:38,380 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:38,479 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-13 05:32:38,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:38,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:38,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:38,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:38,574 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-13 05:32:38,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:38,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-04-13 05:32:38,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 05:32:38,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 05:32:38,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-13 05:32:38,575 INFO L87 Difference]: Start difference. First operand 1680 states and 2193 transitions. Second operand 12 states. [2018-04-13 05:32:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:38,915 INFO L93 Difference]: Finished difference Result 2191 states and 2966 transitions. [2018-04-13 05:32:38,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 05:32:38,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-13 05:32:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:38,922 INFO L225 Difference]: With dead ends: 2191 [2018-04-13 05:32:38,922 INFO L226 Difference]: Without dead ends: 2191 [2018-04-13 05:32:38,923 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-04-13 05:32:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2018-04-13 05:32:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 1680. [2018-04-13 05:32:38,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-04-13 05:32:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2193 transitions. [2018-04-13 05:32:38,959 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2193 transitions. Word has length 58 [2018-04-13 05:32:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:38,959 INFO L459 AbstractCegarLoop]: Abstraction has 1680 states and 2193 transitions. [2018-04-13 05:32:38,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 05:32:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2193 transitions. [2018-04-13 05:32:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-13 05:32:38,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:38,961 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:38,961 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-13 05:32:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1953024946, now seen corresponding path program 1 times [2018-04-13 05:32:38,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:38,961 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:38,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:38,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:38,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:38,974 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:39,018 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-13 05:32:39,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:39,018 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:39,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:39,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:39,082 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-13 05:32:39,083 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:39,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-13 05:32:39,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:39,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:39,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:39,084 INFO L87 Difference]: Start difference. First operand 1680 states and 2193 transitions. Second operand 11 states. [2018-04-13 05:32:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:39,353 INFO L93 Difference]: Finished difference Result 2217 states and 3031 transitions. [2018-04-13 05:32:39,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:32:39,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-04-13 05:32:39,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:39,360 INFO L225 Difference]: With dead ends: 2217 [2018-04-13 05:32:39,360 INFO L226 Difference]: Without dead ends: 2217 [2018-04-13 05:32:39,360 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:32:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2018-04-13 05:32:39,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1680. [2018-04-13 05:32:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2018-04-13 05:32:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2193 transitions. [2018-04-13 05:32:39,386 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2193 transitions. Word has length 66 [2018-04-13 05:32:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:39,386 INFO L459 AbstractCegarLoop]: Abstraction has 1680 states and 2193 transitions. [2018-04-13 05:32:39,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2193 transitions. [2018-04-13 05:32:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-13 05:32:39,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:39,387 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:39,387 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-13 05:32:39,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1759935924, now seen corresponding path program 1 times [2018-04-13 05:32:39,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:39,388 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:39,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:39,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:39,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:39,396 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:39,433 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-13 05:32:39,433 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:39,433 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:39,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:39,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-13 05:32:39,479 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:39,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-13 05:32:39,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:39,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:39,480 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:39,480 INFO L87 Difference]: Start difference. First operand 1680 states and 2193 transitions. Second operand 11 states. [2018-04-13 05:32:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:39,797 INFO L93 Difference]: Finished difference Result 1972 states and 2612 transitions. [2018-04-13 05:32:39,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:32:39,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-04-13 05:32:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:39,805 INFO L225 Difference]: With dead ends: 1972 [2018-04-13 05:32:39,805 INFO L226 Difference]: Without dead ends: 1972 [2018-04-13 05:32:39,805 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:32:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2018-04-13 05:32:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1951. [2018-04-13 05:32:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1951 states. [2018-04-13 05:32:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 2595 transitions. [2018-04-13 05:32:39,840 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 2595 transitions. Word has length 68 [2018-04-13 05:32:39,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:39,841 INFO L459 AbstractCegarLoop]: Abstraction has 1951 states and 2595 transitions. [2018-04-13 05:32:39,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 2595 transitions. [2018-04-13 05:32:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 05:32:39,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:39,842 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:39,842 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-13 05:32:39,843 INFO L82 PathProgramCache]: Analyzing trace with hash -351130211, now seen corresponding path program 1 times [2018-04-13 05:32:39,843 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:39,843 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:39,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:39,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:39,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:39,856 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-13 05:32:39,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:39,906 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:39,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:39,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-13 05:32:39,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:39,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-13 05:32:39,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:39,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:39,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:39,966 INFO L87 Difference]: Start difference. First operand 1951 states and 2595 transitions. Second operand 11 states. [2018-04-13 05:32:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:40,212 INFO L93 Difference]: Finished difference Result 2422 states and 3359 transitions. [2018-04-13 05:32:40,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:32:40,213 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-04-13 05:32:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:40,221 INFO L225 Difference]: With dead ends: 2422 [2018-04-13 05:32:40,221 INFO L226 Difference]: Without dead ends: 2418 [2018-04-13 05:32:40,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:32:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2018-04-13 05:32:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 1907. [2018-04-13 05:32:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1907 states. [2018-04-13 05:32:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2536 transitions. [2018-04-13 05:32:40,260 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2536 transitions. Word has length 72 [2018-04-13 05:32:40,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:40,261 INFO L459 AbstractCegarLoop]: Abstraction has 1907 states and 2536 transitions. [2018-04-13 05:32:40,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2536 transitions. [2018-04-13 05:32:40,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-13 05:32:40,262 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:40,263 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2018-04-13 05:32:40,263 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-13 05:32:40,263 INFO L82 PathProgramCache]: Analyzing trace with hash -638982733, now seen corresponding path program 1 times [2018-04-13 05:32:40,263 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:40,263 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:40,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:40,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:40,264 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:40,277 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 50 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-04-13 05:32:40,393 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:40,393 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:40,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:40,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 71 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-13 05:32:40,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:40,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-04-13 05:32:40,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 05:32:40,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 05:32:40,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-04-13 05:32:40,499 INFO L87 Difference]: Start difference. First operand 1907 states and 2536 transitions. Second operand 13 states. [2018-04-13 05:32:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:40,770 INFO L93 Difference]: Finished difference Result 2416 states and 3266 transitions. [2018-04-13 05:32:40,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:32:40,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2018-04-13 05:32:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:40,780 INFO L225 Difference]: With dead ends: 2416 [2018-04-13 05:32:40,780 INFO L226 Difference]: Without dead ends: 2416 [2018-04-13 05:32:40,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-04-13 05:32:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2018-04-13 05:32:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2152. [2018-04-13 05:32:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-04-13 05:32:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2890 transitions. [2018-04-13 05:32:40,830 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2890 transitions. Word has length 73 [2018-04-13 05:32:40,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:40,830 INFO L459 AbstractCegarLoop]: Abstraction has 2152 states and 2890 transitions. [2018-04-13 05:32:40,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 05:32:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2890 transitions. [2018-04-13 05:32:40,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-13 05:32:40,832 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:40,832 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:40,832 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-13 05:32:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash 623126807, now seen corresponding path program 1 times [2018-04-13 05:32:40,832 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:40,832 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:40,833 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:40,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:40,833 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:40,846 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 75 proven. 18 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-13 05:32:40,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:40,896 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:40,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:40,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 98 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-04-13 05:32:40,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:40,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-04-13 05:32:40,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-13 05:32:40,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-13 05:32:40,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-13 05:32:40,959 INFO L87 Difference]: Start difference. First operand 2152 states and 2890 transitions. Second operand 11 states. [2018-04-13 05:32:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:41,291 INFO L93 Difference]: Finished difference Result 2416 states and 3279 transitions. [2018-04-13 05:32:41,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-13 05:32:41,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-04-13 05:32:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:41,298 INFO L225 Difference]: With dead ends: 2416 [2018-04-13 05:32:41,298 INFO L226 Difference]: Without dead ends: 2416 [2018-04-13 05:32:41,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-04-13 05:32:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2018-04-13 05:32:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2152. [2018-04-13 05:32:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-04-13 05:32:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2890 transitions. [2018-04-13 05:32:41,336 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2890 transitions. Word has length 81 [2018-04-13 05:32:41,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:41,336 INFO L459 AbstractCegarLoop]: Abstraction has 2152 states and 2890 transitions. [2018-04-13 05:32:41,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-13 05:32:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2890 transitions. [2018-04-13 05:32:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-13 05:32:41,338 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:41,338 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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] [2018-04-13 05:32:41,338 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-13 05:32:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash 523995112, now seen corresponding path program 1 times [2018-04-13 05:32:41,338 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:41,338 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:41,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:41,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:41,339 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:41,347 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 05:32:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-04-13 05:32:41,448 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 05:32:41,448 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 05:32:41,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 05:32:41,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 05:32:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 107 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-04-13 05:32:41,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 05:32:41,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 13 [2018-04-13 05:32:41,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 05:32:41,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 05:32:41,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-04-13 05:32:41,540 INFO L87 Difference]: Start difference. First operand 2152 states and 2890 transitions. Second operand 13 states. [2018-04-13 05:32:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 05:32:41,898 INFO L93 Difference]: Finished difference Result 2661 states and 3605 transitions. [2018-04-13 05:32:41,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 05:32:41,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2018-04-13 05:32:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 05:32:41,907 INFO L225 Difference]: With dead ends: 2661 [2018-04-13 05:32:41,907 INFO L226 Difference]: Without dead ends: 2661 [2018-04-13 05:32:41,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-04-13 05:32:41,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2018-04-13 05:32:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2152. [2018-04-13 05:32:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2152 states. [2018-04-13 05:32:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2866 transitions. [2018-04-13 05:32:41,952 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2866 transitions. Word has length 87 [2018-04-13 05:32:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 05:32:41,952 INFO L459 AbstractCegarLoop]: Abstraction has 2152 states and 2866 transitions. [2018-04-13 05:32:41,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 05:32:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2866 transitions. [2018-04-13 05:32:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-13 05:32:41,954 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 05:32:41,954 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 05:32:41,954 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-13 05:32:41,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1015411636, now seen corresponding path program 1 times [2018-04-13 05:32:41,954 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 05:32:41,955 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 05:32:41,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:41,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 05:32:41,955 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 05:32:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 05:32:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-13 05:32:42,026 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-13 05:32:42,088 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-13 05:32:42,098 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-13 05:32:42,098 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-13 05:32:42,099 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-13 05:32:42,100 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-13 05:32:42,100 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-13 05:32:42,101 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-13 05:32:42,104 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-13 05:32:42,105 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-13 05:32:42,105 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-13 05:32:42,106 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-13 05:32:42,108 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-13 05:32:42,108 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-13 05:32:42,109 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-13 05:32:42,109 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-13 05:32:42,111 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-13 05:32:42,112 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-13 05:32:42,112 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-13 05:32:42,113 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-13 05:32:42,113 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-13 05:32:42,113 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-13 05:32:42,115 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-13 05:32:42,115 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-13 05:32:42,116 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-13 05:32:42,116 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-13 05:32:42,116 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-13 05:32:42,117 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-13 05:32:42,117 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-13 05:32:42,119 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-13 05:32:42,119 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-13 05:32:42,119 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-13 05:32:42,120 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-13 05:32:42,120 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-13 05:32:42,120 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-13 05:32:42,121 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-13 05:32:42,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:32:42 BoogieIcfgContainer [2018-04-13 05:32:42,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 05:32:42,135 INFO L168 Benchmark]: Toolchain (without parser) took 10786.69 ms. Allocated memory was 398.5 MB in the beginning and 924.8 MB in the end (delta: 526.4 MB). Free memory was 336.6 MB in the beginning and 542.2 MB in the end (delta: -205.6 MB). Peak memory consumption was 320.8 MB. Max. memory is 5.3 GB. [2018-04-13 05:32:42,136 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 398.5 MB. Free memory is still 361.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 05:32:42,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.90 ms. Allocated memory is still 398.5 MB. Free memory was 335.3 MB in the beginning and 310.1 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-13 05:32:42,136 INFO L168 Benchmark]: Boogie Preprocessor took 49.45 ms. Allocated memory is still 398.5 MB. Free memory was 310.1 MB in the beginning and 306.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 5.3 GB. [2018-04-13 05:32:42,137 INFO L168 Benchmark]: RCFGBuilder took 416.87 ms. Allocated memory was 398.5 MB in the beginning and 603.5 MB in the end (delta: 205.0 MB). Free memory was 305.5 MB in the beginning and 531.2 MB in the end (delta: -225.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 05:32:42,137 INFO L168 Benchmark]: TraceAbstraction took 10062.71 ms. Allocated memory was 603.5 MB in the beginning and 924.8 MB in the end (delta: 321.4 MB). Free memory was 531.2 MB in the beginning and 542.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 310.4 MB. Max. memory is 5.3 GB. [2018-04-13 05:32:42,139 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.18 ms. Allocated memory is still 398.5 MB. Free memory is still 361.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 254.90 ms. Allocated memory is still 398.5 MB. Free memory was 335.3 MB in the beginning and 310.1 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.45 ms. Allocated memory is still 398.5 MB. Free memory was 310.1 MB in the beginning and 306.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 416.87 ms. Allocated memory was 398.5 MB in the beginning and 603.5 MB in the end (delta: 205.0 MB). Free memory was 305.5 MB in the beginning and 531.2 MB in the end (delta: -225.7 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10062.71 ms. Allocated memory was 603.5 MB in the beginning and 924.8 MB in the end (delta: 321.4 MB). Free memory was 531.2 MB in the beginning and 542.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 310.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 688]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L625] int pc1 = 1; [L626] int pc4 = 1; [L624] struct cell *S; [L627] static struct cell *t1 = ((void *)0); [L628] static struct cell *x1 = ((void *)0); [L657] struct cell* garbage; [L658] static struct cell *t4 = ((void *)0); [L659] static struct cell *x4 = ((void *)0); [L662] static int res4; VAL [\old(garbage)=17, \old(garbage)=23, \old(pc1)=26, \old(pc4)=16, \old(res4)=15, \old(S)=12, \old(S)=25, \old(t1)=22, \old(t1)=24, \old(t4)=18, \old(t4)=13, \old(x1)=14, \old(x1)=20, \old(x4)=21, \old(x4)=11, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L632] COND TRUE case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] EXPR, FCALL malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L633] x1 = malloc(sizeof(*x1)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L634] FCALL x1->data = 0 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L635] RET, FCALL x1->next = ((void *)0) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, malloc(sizeof(*x1))={10:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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)=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}] [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)=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}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L640] COND TRUE case 3: [L641] RET t1 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L644] RET, FCALL x1->next = t1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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}] [L632] COND FALSE !(case 1:) [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L637] COND FALSE !(case 2:) [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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}] [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)=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}] [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)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=1, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND TRUE 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() [L691] COND TRUE __VERIFIER_nondet_int() [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=10, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L631] pc1++ [L631] pc1++ [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=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)=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}] [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)=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}] [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)=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}] [L643] COND FALSE !(case 4:) [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=10, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L646] COND FALSE !(case 5:) [L652] case 6: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=10, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=10, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L652] COND TRUE case 6: [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=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=1, pc1++=6, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L692] push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L690] 1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int() VAL [1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()=0, \old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L690] COND FALSE !(1 != pc1 || 1 != pc4 || __VERIFIER_nondet_int()) [L696] COND FALSE !(\read(*garbage)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={10:0}, t1={0:0}, t4={0:0}, x1={10:0}, x4={0:0}] [L701] S = ((void *)0) [L702] t1 = ((void *)0) [L703] x1 = ((void *)0) [L704] t4 = ((void *)0) [L705] x4 = ((void *)0) [L706] return !!garbage; VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, \result=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 78 locations, 19 error locations. UNSAFE Result, 10.0s OverallTime, 27 OverallIterations, 7 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2408 SDtfs, 4706 SDslu, 5223 SDs, 0 SdLazy, 4993 SolverSat, 711 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 914 SyntacticMatches, 33 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2510occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 4499 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2031 NumberOfCodeBlocks, 2031 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1894 ConstructedInterpolants, 0 QuantifiedInterpolants, 277310 SizeOfPredicates, 57 NumberOfNonLiveVariables, 6860 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 42 InterpolantComputations, 12 PerfectInterpolantSequences, 1622/1851 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_05-32-42-149.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_05-32-42-149.csv Received shutdown request...