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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 20:09:24,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 20:09:24,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 20:09:24,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 20:09:24,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 20:09:24,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 20:09:24,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 20:09:24,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 20:09:24,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 20:09:24,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 20:09:24,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 20:09:24,885 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 20:09:24,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 20:09:24,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 20:09:24,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 20:09:24,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 20:09:24,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 20:09:24,894 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 20:09:24,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 20:09:24,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 20:09:24,898 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 20:09:24,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 20:09:24,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 20:09:24,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 20:09:24,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 20:09:24,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 20:09:24,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 20:09:24,903 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 20:09:24,904 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 20:09:24,904 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 20:09:24,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 20:09:24,905 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-06 20:09:24,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 20:09:24,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 20:09:24,930 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 20:09:24,930 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 20:09:24,931 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 20:09:24,931 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 20:09:24,931 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 20:09:24,932 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 20:09:24,932 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 20:09:24,932 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 20:09:24,932 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 20:09:24,933 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 20:09:24,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 20:09:24,933 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 20:09:24,933 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 20:09:24,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 20:09:24,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 20:09:24,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 20:09:24,934 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 20:09:24,934 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 20:09:24,934 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 20:09:24,935 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 20:09:24,935 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 20:09:24,935 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 20:09:24,935 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 20:09:24,935 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 20:09:24,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 20:09:24,936 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 20:09:24,936 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 20:09:24,936 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 20:09:24,936 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 20:09:24,936 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 20:09:24,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:24,937 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 20:09:24,938 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 20:09:24,938 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 20:09:24,938 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 20:09:24,938 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 20:09:24,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 20:09:24,986 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 20:09:24,990 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 20:09:24,992 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 20:09:24,992 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 20:09:24,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-04-06 20:09:25,346 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG4867f16ba [2018-04-06 20:09:25,535 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 20:09:25,535 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 20:09:25,536 INFO L168 CDTParser]: Scanning lockfree-3.1_false-valid-memtrack.i [2018-04-06 20:09:25,545 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 20:09:25,545 INFO L215 ultiparseSymbolTable]: [2018-04-06 20:09:25,545 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 20:09:25,546 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in lockfree-3.1_false-valid-memtrack.i [2018-04-06 20:09:25,546 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-06 20:09:25,546 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-06 20:09:25,546 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 20:09:25,546 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-06 20:09:25,546 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-06 20:09:25,546 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-06 20:09:25,546 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-06 20:09:25,547 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-06 20:09:25,547 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-06 20:09:25,547 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-06 20:09:25,547 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-06 20:09:25,547 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-06 20:09:25,547 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-06 20:09:25,547 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-06 20:09:25,547 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-06 20:09:25,548 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-06 20:09:25,548 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-06 20:09:25,548 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-06 20:09:25,548 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-06 20:09:25,548 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-06 20:09:25,548 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-06 20:09:25,548 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-06 20:09:25,548 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-06 20:09:25,548 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-06 20:09:25,549 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-06 20:09:25,549 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-06 20:09:25,549 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-06 20:09:25,549 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-06 20:09:25,549 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-06 20:09:25,549 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-06 20:09:25,549 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-06 20:09:25,549 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-06 20:09:25,550 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-06 20:09:25,550 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-06 20:09:25,550 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-06 20:09:25,550 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-06 20:09:25,550 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-06 20:09:25,550 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-06 20:09:25,550 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-06 20:09:25,550 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-06 20:09:25,550 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-06 20:09:25,551 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-06 20:09:25,551 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-06 20:09:25,551 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-06 20:09:25,551 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-06 20:09:25,551 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-06 20:09:25,551 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-06 20:09:25,551 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-06 20:09:25,552 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-06 20:09:25,552 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-06 20:09:25,552 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-06 20:09:25,552 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-06 20:09:25,552 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-06 20:09:25,552 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-06 20:09:25,552 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-06 20:09:25,552 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-06 20:09:25,552 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,553 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,554 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,555 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,556 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-06 20:09:25,557 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-06 20:09:25,557 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-06 20:09:25,557 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-06 20:09:25,557 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-06 20:09:25,557 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-06 20:09:25,557 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-06 20:09:25,557 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-06 20:09:25,557 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-06 20:09:25,557 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-06 20:09:25,558 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-06 20:09:25,558 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-06 20:09:25,558 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-06 20:09:25,558 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-06 20:09:25,558 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-06 20:09:25,558 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-06 20:09:25,558 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-06 20:09:25,578 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG4867f16ba [2018-04-06 20:09:25,583 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 20:09:25,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 20:09:25,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 20:09:25,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 20:09:25,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 20:09:25,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 08:09:25" (1/1) ... [2018-04-06 20:09:25,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106292c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25, skipping insertion in model container [2018-04-06 20:09:25,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 08:09:25" (1/1) ... [2018-04-06 20:09:25,609 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 20:09:25,644 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 20:09:25,832 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 20:09:25,883 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 20:09:25,891 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-06 20:09:25,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25 WrapperNode [2018-04-06 20:09:25,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 20:09:25,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 20:09:25,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 20:09:25,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 20:09:25,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25" (1/1) ... [2018-04-06 20:09:25,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25" (1/1) ... [2018-04-06 20:09:25,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25" (1/1) ... [2018-04-06 20:09:25,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25" (1/1) ... [2018-04-06 20:09:25,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25" (1/1) ... [2018-04-06 20:09:26,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25" (1/1) ... [2018-04-06 20:09:26,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25" (1/1) ... [2018-04-06 20:09:26,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 20:09:26,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 20:09:26,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 20:09:26,011 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 20:09:26,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25" (1/1) ... No working directory specified, using /storage/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-06 20:09:26,132 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 20:09:26,132 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 20:09:26,132 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-06 20:09:26,133 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-06 20:09:26,133 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 20:09:26,133 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-06 20:09:26,133 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 20:09:26,133 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 20:09:26,133 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 20:09:26,134 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 20:09:26,134 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 20:09:26,134 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 20:09:26,134 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 20:09:26,134 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 20:09:26,134 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 20:09:26,134 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 20:09:26,134 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 20:09:26,135 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 20:09:26,135 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 20:09:26,135 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 20:09:26,135 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 20:09:26,135 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 20:09:26,135 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 20:09:26,135 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 20:09:26,136 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 20:09:26,136 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 20:09:26,136 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 20:09:26,136 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 20:09:26,136 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 20:09:26,136 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 20:09:26,136 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 20:09:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 20:09:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 20:09:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 20:09:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 20:09:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 20:09:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 20:09:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 20:09:26,137 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 20:09:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 20:09:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 20:09:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 20:09:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 20:09:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 20:09:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 20:09:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 20:09:26,138 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 20:09:26,139 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 20:09:26,139 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 20:09:26,139 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 20:09:26,139 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 20:09:26,139 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 20:09:26,139 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 20:09:26,139 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 20:09:26,139 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 20:09:26,140 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 20:09:26,140 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 20:09:26,140 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 20:09:26,140 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 20:09:26,140 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 20:09:26,140 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 20:09:26,140 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 20:09:26,140 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 20:09:26,141 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 20:09:26,141 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 20:09:26,141 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 20:09:26,141 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 20:09:26,141 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 20:09:26,141 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 20:09:26,141 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 20:09:26,141 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-06 20:09:26,142 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 20:09:26,142 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 20:09:26,142 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 20:09:26,142 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 20:09:26,142 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 20:09:26,142 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 20:09:26,142 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 20:09:26,143 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 20:09:26,143 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 20:09:26,143 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 20:09:26,143 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 20:09:26,143 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 20:09:26,143 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 20:09:26,143 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 20:09:26,143 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 20:09:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 20:09:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 20:09:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 20:09:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 20:09:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 20:09:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 20:09:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 20:09:26,144 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 20:09:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 20:09:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 20:09:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 20:09:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 20:09:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 20:09:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 20:09:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 20:09:26,145 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 20:09:26,146 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 20:09:26,146 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 20:09:26,146 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 20:09:26,146 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 20:09:26,146 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 20:09:26,146 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 20:09:26,146 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-06 20:09:26,146 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 20:09:26,147 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 20:09:26,147 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-06 20:09:26,147 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-06 20:09:26,147 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-06 20:09:26,147 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 20:09:26,147 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 20:09:26,147 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 20:09:26,147 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 20:09:26,147 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 20:09:26,148 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 20:09:26,649 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 20:09:26,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:09:26 BoogieIcfgContainer [2018-04-06 20:09:26,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 20:09:26,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 20:09:26,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 20:09:26,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 20:09:26,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 08:09:25" (1/3) ... [2018-04-06 20:09:26,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e8d137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 08:09:26, skipping insertion in model container [2018-04-06 20:09:26,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:09:25" (2/3) ... [2018-04-06 20:09:26,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e8d137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 08:09:26, skipping insertion in model container [2018-04-06 20:09:26,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:09:26" (3/3) ... [2018-04-06 20:09:26,657 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-04-06 20:09:26,664 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 20:09:26,670 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-06 20:09:26,718 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 20:09:26,719 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 20:09:26,719 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 20:09:26,719 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 20:09:26,719 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 20:09:26,720 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 20:09:26,720 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 20:09:26,720 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 20:09:26,720 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 20:09:26,721 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 20:09:26,740 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2018-04-06 20:09:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-06 20:09:26,746 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:26,747 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:26,747 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-06 20:09:26,751 INFO L82 PathProgramCache]: Analyzing trace with hash 831500316, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:26,762 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:26,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:26,850 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-06 20:09:26,850 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:26,880 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-06 20:09:26,917 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:26,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-06 20:09:26,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-06 20:09:26,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-06 20:09:26,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-06 20:09:26,932 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2018-04-06 20:09:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:26,959 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2018-04-06 20:09:26,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-06 20:09:26,961 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-04-06 20:09:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:26,975 INFO L225 Difference]: With dead ends: 153 [2018-04-06 20:09:26,976 INFO L226 Difference]: Without dead ends: 126 [2018-04-06 20:09:26,979 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 37 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-06 20:09:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-06 20:09:27,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-06 20:09:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-06 20:09:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2018-04-06 20:09:27,020 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 19 [2018-04-06 20:09:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:27,021 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2018-04-06 20:09:27,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-06 20:09:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2018-04-06 20:09:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-06 20:09:27,022 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:27,022 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:27,022 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-06 20:09:27,022 INFO L82 PathProgramCache]: Analyzing trace with hash -948182125, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:27,028 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:27,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:27,088 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-06 20:09:27,088 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:27,102 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-06 20:09:27,132 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:27,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:09:27,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 20:09:27,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 20:09:27,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 20:09:27,135 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 3 states. [2018-04-06 20:09:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:27,153 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2018-04-06 20:09:27,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 20:09:27,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-06 20:09:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:27,155 INFO L225 Difference]: With dead ends: 150 [2018-04-06 20:09:27,155 INFO L226 Difference]: Without dead ends: 127 [2018-04-06 20:09:27,156 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-06 20:09:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-06 20:09:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-04-06 20:09:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-06 20:09:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2018-04-06 20:09:27,165 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 24 [2018-04-06 20:09:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:27,165 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2018-04-06 20:09:27,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 20:09:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2018-04-06 20:09:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-06 20:09:27,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:27,166 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:27,166 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-06 20:09:27,166 INFO L82 PathProgramCache]: Analyzing trace with hash -334951210, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:27,173 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:27,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:27,249 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-06 20:09:27,249 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:27,281 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-06 20:09:27,302 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:27,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:09:27,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 20:09:27,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 20:09:27,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 20:09:27,304 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 3 states. [2018-04-06 20:09:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:27,351 INFO L93 Difference]: Finished difference Result 240 states and 276 transitions. [2018-04-06 20:09:27,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 20:09:27,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-06 20:09:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:27,354 INFO L225 Difference]: With dead ends: 240 [2018-04-06 20:09:27,354 INFO L226 Difference]: Without dead ends: 219 [2018-04-06 20:09:27,355 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-06 20:09:27,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-06 20:09:27,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2018-04-06 20:09:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-06 20:09:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 245 transitions. [2018-04-06 20:09:27,378 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 245 transitions. Word has length 26 [2018-04-06 20:09:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:27,379 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 245 transitions. [2018-04-06 20:09:27,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 20:09:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 245 transitions. [2018-04-06 20:09:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-06 20:09:27,381 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:27,381 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:27,381 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-06 20:09:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash -251404699, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:27,402 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:27,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:27,489 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-06 20:09:27,490 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:27,535 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-06 20:09:27,570 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:27,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 20:09:27,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 20:09:27,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 20:09:27,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-06 20:09:27,571 INFO L87 Difference]: Start difference. First operand 200 states and 245 transitions. Second operand 5 states. [2018-04-06 20:09:27,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:27,723 INFO L93 Difference]: Finished difference Result 579 states and 711 transitions. [2018-04-06 20:09:27,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 20:09:27,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-06 20:09:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:27,728 INFO L225 Difference]: With dead ends: 579 [2018-04-06 20:09:27,728 INFO L226 Difference]: Without dead ends: 394 [2018-04-06 20:09:27,730 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-06 20:09:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-06 20:09:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 314. [2018-04-06 20:09:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-06 20:09:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 396 transitions. [2018-04-06 20:09:27,766 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 396 transitions. Word has length 32 [2018-04-06 20:09:27,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:27,767 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 396 transitions. [2018-04-06 20:09:27,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 20:09:27,767 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 396 transitions. [2018-04-06 20:09:27,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-06 20:09:27,768 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:27,768 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:27,768 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-06 20:09:27,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1668850665, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:27,781 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:27,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:27,830 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-06 20:09:27,830 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:27,838 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-06 20:09:27,860 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:27,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-06 20:09:27,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-06 20:09:27,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-06 20:09:27,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-06 20:09:27,861 INFO L87 Difference]: Start difference. First operand 314 states and 396 transitions. Second operand 3 states. [2018-04-06 20:09:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:27,976 INFO L93 Difference]: Finished difference Result 424 states and 544 transitions. [2018-04-06 20:09:27,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 20:09:27,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-04-06 20:09:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:27,981 INFO L225 Difference]: With dead ends: 424 [2018-04-06 20:09:27,981 INFO L226 Difference]: Without dead ends: 412 [2018-04-06 20:09:27,982 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-06 20:09:27,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-04-06 20:09:28,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 400. [2018-04-06 20:09:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-04-06 20:09:28,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 517 transitions. [2018-04-06 20:09:28,013 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 517 transitions. Word has length 32 [2018-04-06 20:09:28,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:28,014 INFO L459 AbstractCegarLoop]: Abstraction has 400 states and 517 transitions. [2018-04-06 20:09:28,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-06 20:09:28,014 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 517 transitions. [2018-04-06 20:09:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-06 20:09:28,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:28,015 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:28,015 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-06 20:09:28,015 INFO L82 PathProgramCache]: Analyzing trace with hash -62843736, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:28,023 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:28,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:28,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:09:28,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:09:28,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:09:28,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:09:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:28,106 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:28,122 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-06 20:09:28,145 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:28,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:09:28,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 20:09:28,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 20:09:28,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:09:28,146 INFO L87 Difference]: Start difference. First operand 400 states and 517 transitions. Second operand 4 states. [2018-04-06 20:09:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:28,284 INFO L93 Difference]: Finished difference Result 681 states and 882 transitions. [2018-04-06 20:09:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 20:09:28,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-04-06 20:09:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:28,291 INFO L225 Difference]: With dead ends: 681 [2018-04-06 20:09:28,291 INFO L226 Difference]: Without dead ends: 677 [2018-04-06 20:09:28,292 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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-06 20:09:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-04-06 20:09:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 646. [2018-04-06 20:09:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-04-06 20:09:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 850 transitions. [2018-04-06 20:09:28,338 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 850 transitions. Word has length 34 [2018-04-06 20:09:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:28,339 INFO L459 AbstractCegarLoop]: Abstraction has 646 states and 850 transitions. [2018-04-06 20:09:28,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 20:09:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 850 transitions. [2018-04-06 20:09:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-06 20:09:28,340 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:28,340 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:28,340 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-06 20:09:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash -62843735, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:28,349 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:28,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:28,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:09:28,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:09:28,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:09:28,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 20:09:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:28,466 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:28,487 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-06 20:09:28,508 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:28,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 20:09:28,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 20:09:28,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 20:09:28,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 20:09:28,509 INFO L87 Difference]: Start difference. First operand 646 states and 850 transitions. Second operand 6 states. [2018-04-06 20:09:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:28,730 INFO L93 Difference]: Finished difference Result 1121 states and 1457 transitions. [2018-04-06 20:09:28,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 20:09:28,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-06 20:09:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:28,739 INFO L225 Difference]: With dead ends: 1121 [2018-04-06 20:09:28,739 INFO L226 Difference]: Without dead ends: 1117 [2018-04-06 20:09:28,740 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 20:09:28,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2018-04-06 20:09:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1062. [2018-04-06 20:09:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2018-04-06 20:09:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1403 transitions. [2018-04-06 20:09:28,803 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1403 transitions. Word has length 34 [2018-04-06 20:09:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:28,803 INFO L459 AbstractCegarLoop]: Abstraction has 1062 states and 1403 transitions. [2018-04-06 20:09:28,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 20:09:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1403 transitions. [2018-04-06 20:09:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-06 20:09:28,804 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:28,804 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:28,805 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-06 20:09:28,805 INFO L82 PathProgramCache]: Analyzing trace with hash -62566616, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:28,814 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:28,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:28,916 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-06 20:09:28,917 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:29,008 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:29,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2018-04-06 20:09:29,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-06 20:09:29,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-06 20:09:29,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-06 20:09:29,010 INFO L87 Difference]: Start difference. First operand 1062 states and 1403 transitions. Second operand 11 states. [2018-04-06 20:09:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:29,291 INFO L93 Difference]: Finished difference Result 2575 states and 3451 transitions. [2018-04-06 20:09:29,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 20:09:29,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-04-06 20:09:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:29,302 INFO L225 Difference]: With dead ends: 2575 [2018-04-06 20:09:29,302 INFO L226 Difference]: Without dead ends: 1528 [2018-04-06 20:09:29,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-04-06 20:09:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-04-06 20:09:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1434. [2018-04-06 20:09:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2018-04-06 20:09:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1862 transitions. [2018-04-06 20:09:29,391 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1862 transitions. Word has length 34 [2018-04-06 20:09:29,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:29,391 INFO L459 AbstractCegarLoop]: Abstraction has 1434 states and 1862 transitions. [2018-04-06 20:09:29,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-06 20:09:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1862 transitions. [2018-04-06 20:09:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 20:09:29,392 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:29,393 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:29,393 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-06 20:09:29,393 INFO L82 PathProgramCache]: Analyzing trace with hash 928594531, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:29,402 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:29,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:29,530 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-06 20:09:29,530 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:29,572 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-06 20:09:29,594 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:29,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 12 [2018-04-06 20:09:29,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 20:09:29,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 20:09:29,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-04-06 20:09:29,595 INFO L87 Difference]: Start difference. First operand 1434 states and 1862 transitions. Second operand 12 states. [2018-04-06 20:09:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:30,559 INFO L93 Difference]: Finished difference Result 5249 states and 6837 transitions. [2018-04-06 20:09:30,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-06 20:09:30,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-04-06 20:09:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:30,571 INFO L225 Difference]: With dead ends: 5249 [2018-04-06 20:09:30,571 INFO L226 Difference]: Without dead ends: 3830 [2018-04-06 20:09:30,575 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2018-04-06 20:09:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3830 states. [2018-04-06 20:09:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3830 to 3722. [2018-04-06 20:09:30,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3722 states. [2018-04-06 20:09:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 4706 transitions. [2018-04-06 20:09:30,698 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 4706 transitions. Word has length 36 [2018-04-06 20:09:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:30,698 INFO L459 AbstractCegarLoop]: Abstraction has 3722 states and 4706 transitions. [2018-04-06 20:09:30,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 20:09:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 4706 transitions. [2018-04-06 20:09:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 20:09:30,700 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:30,700 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:30,700 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-06 20:09:30,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1185822231, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:30,707 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:30,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:30,960 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:31,117 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:31,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-06 20:09:31,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 20:09:31,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 20:09:31,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-06 20:09:31,118 INFO L87 Difference]: Start difference. First operand 3722 states and 4706 transitions. Second operand 9 states. [2018-04-06 20:09:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:31,354 INFO L93 Difference]: Finished difference Result 8449 states and 10773 transitions. [2018-04-06 20:09:31,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 20:09:31,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-04-06 20:09:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:31,371 INFO L225 Difference]: With dead ends: 8449 [2018-04-06 20:09:31,371 INFO L226 Difference]: Without dead ends: 4742 [2018-04-06 20:09:31,378 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-06 20:09:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2018-04-06 20:09:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 4610. [2018-04-06 20:09:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4610 states. [2018-04-06 20:09:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 5794 transitions. [2018-04-06 20:09:31,562 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 5794 transitions. Word has length 54 [2018-04-06 20:09:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:31,563 INFO L459 AbstractCegarLoop]: Abstraction has 4610 states and 5794 transitions. [2018-04-06 20:09:31,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 20:09:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 5794 transitions. [2018-04-06 20:09:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-06 20:09:31,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:31,564 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:31,564 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-06 20:09:31,564 INFO L82 PathProgramCache]: Analyzing trace with hash -682198927, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:31,571 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:31,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:31,770 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:31,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:09:31,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-04-06 20:09:31,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 20:09:31,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 20:09:31,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-04-06 20:09:31,854 INFO L87 Difference]: Start difference. First operand 4610 states and 5794 transitions. Second operand 13 states. [2018-04-06 20:09:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:32,553 INFO L93 Difference]: Finished difference Result 18503 states and 23073 transitions. [2018-04-06 20:09:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-06 20:09:32,572 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-04-06 20:09:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:32,642 INFO L225 Difference]: With dead ends: 18503 [2018-04-06 20:09:32,642 INFO L226 Difference]: Without dead ends: 13908 [2018-04-06 20:09:32,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2018-04-06 20:09:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13908 states. [2018-04-06 20:09:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13908 to 10959. [2018-04-06 20:09:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10959 states. [2018-04-06 20:09:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10959 states to 10959 states and 13393 transitions. [2018-04-06 20:09:33,183 INFO L78 Accepts]: Start accepts. Automaton has 10959 states and 13393 transitions. Word has length 57 [2018-04-06 20:09:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:33,184 INFO L459 AbstractCegarLoop]: Abstraction has 10959 states and 13393 transitions. [2018-04-06 20:09:33,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 20:09:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 10959 states and 13393 transitions. [2018-04-06 20:09:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-06 20:09:33,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:33,186 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:33,186 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-06 20:09:33,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1922865957, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:33,194 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:33,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:33,308 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:33,399 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:09:33,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2018-04-06 20:09:33,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-06 20:09:33,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-06 20:09:33,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-06 20:09:33,401 INFO L87 Difference]: Start difference. First operand 10959 states and 13393 transitions. Second operand 11 states. [2018-04-06 20:09:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:33,894 INFO L93 Difference]: Finished difference Result 14643 states and 17759 transitions. [2018-04-06 20:09:33,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-06 20:09:33,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-04-06 20:09:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:33,909 INFO L225 Difference]: With dead ends: 14643 [2018-04-06 20:09:33,910 INFO L226 Difference]: Without dead ends: 3363 [2018-04-06 20:09:33,938 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-04-06 20:09:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2018-04-06 20:09:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3224. [2018-04-06 20:09:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3224 states. [2018-04-06 20:09:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3224 states to 3224 states and 3856 transitions. [2018-04-06 20:09:34,062 INFO L78 Accepts]: Start accepts. Automaton has 3224 states and 3856 transitions. Word has length 62 [2018-04-06 20:09:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:34,063 INFO L459 AbstractCegarLoop]: Abstraction has 3224 states and 3856 transitions. [2018-04-06 20:09:34,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-06 20:09:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 3224 states and 3856 transitions. [2018-04-06 20:09:34,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-06 20:09:34,065 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:34,065 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:34,065 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-06 20:09:34,066 INFO L82 PathProgramCache]: Analyzing trace with hash 648684445, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:34,075 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:34,139 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:34,201 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:34,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:09:34,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-04-06 20:09:34,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 20:09:34,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 20:09:34,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-06 20:09:34,827 INFO L87 Difference]: Start difference. First operand 3224 states and 3856 transitions. Second operand 12 states. [2018-04-06 20:09:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:35,529 INFO L93 Difference]: Finished difference Result 13104 states and 16357 transitions. [2018-04-06 20:09:35,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-06 20:09:35,530 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2018-04-06 20:09:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:35,565 INFO L225 Difference]: With dead ends: 13104 [2018-04-06 20:09:35,565 INFO L226 Difference]: Without dead ends: 9895 [2018-04-06 20:09:35,575 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-04-06 20:09:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9895 states. [2018-04-06 20:09:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9895 to 8954. [2018-04-06 20:09:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8954 states. [2018-04-06 20:09:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8954 states to 8954 states and 10872 transitions. [2018-04-06 20:09:35,935 INFO L78 Accepts]: Start accepts. Automaton has 8954 states and 10872 transitions. Word has length 72 [2018-04-06 20:09:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:35,935 INFO L459 AbstractCegarLoop]: Abstraction has 8954 states and 10872 transitions. [2018-04-06 20:09:35,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 20:09:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8954 states and 10872 transitions. [2018-04-06 20:09:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-06 20:09:35,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:35,938 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:35,938 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-06 20:09:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1491505209, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:35,950 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:36,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:36,090 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:36,171 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:36,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:09:36,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-04-06 20:09:36,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 20:09:36,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 20:09:36,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-06 20:09:36,194 INFO L87 Difference]: Start difference. First operand 8954 states and 10872 transitions. Second operand 13 states. [2018-04-06 20:09:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:36,899 INFO L93 Difference]: Finished difference Result 18828 states and 22862 transitions. [2018-04-06 20:09:36,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-06 20:09:36,900 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-04-06 20:09:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:36,928 INFO L225 Difference]: With dead ends: 18828 [2018-04-06 20:09:36,928 INFO L226 Difference]: Without dead ends: 9457 [2018-04-06 20:09:36,949 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2018-04-06 20:09:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9457 states. [2018-04-06 20:09:37,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9457 to 8897. [2018-04-06 20:09:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8897 states. [2018-04-06 20:09:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 10778 transitions. [2018-04-06 20:09:37,291 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 10778 transitions. Word has length 79 [2018-04-06 20:09:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:37,291 INFO L459 AbstractCegarLoop]: Abstraction has 8897 states and 10778 transitions. [2018-04-06 20:09:37,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 20:09:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 10778 transitions. [2018-04-06 20:09:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-06 20:09:37,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:37,294 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:37,294 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-06 20:09:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash -876185036, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:37,302 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:37,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:37,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:37,445 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:37,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:09:37,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-06 20:09:37,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-06 20:09:37,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-06 20:09:37,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-04-06 20:09:37,592 INFO L87 Difference]: Start difference. First operand 8897 states and 10778 transitions. Second operand 16 states. [2018-04-06 20:09:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:38,261 INFO L93 Difference]: Finished difference Result 19631 states and 24160 transitions. [2018-04-06 20:09:38,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-06 20:09:38,262 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-04-06 20:09:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:38,303 INFO L225 Difference]: With dead ends: 19631 [2018-04-06 20:09:38,303 INFO L226 Difference]: Without dead ends: 12072 [2018-04-06 20:09:38,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2018-04-06 20:09:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12072 states. [2018-04-06 20:09:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12072 to 11473. [2018-04-06 20:09:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11473 states. [2018-04-06 20:09:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11473 states to 11473 states and 14180 transitions. [2018-04-06 20:09:38,884 INFO L78 Accepts]: Start accepts. Automaton has 11473 states and 14180 transitions. Word has length 81 [2018-04-06 20:09:38,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:38,884 INFO L459 AbstractCegarLoop]: Abstraction has 11473 states and 14180 transitions. [2018-04-06 20:09:38,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-06 20:09:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 11473 states and 14180 transitions. [2018-04-06 20:09:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-06 20:09:38,887 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:38,887 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:38,887 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-06 20:09:38,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1170271716, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:38,893 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:38,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:38,986 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:39,083 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:39,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:09:39,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-04-06 20:09:39,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-06 20:09:39,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-06 20:09:39,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-06 20:09:39,113 INFO L87 Difference]: Start difference. First operand 11473 states and 14180 transitions. Second operand 17 states. [2018-04-06 20:09:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:40,118 INFO L93 Difference]: Finished difference Result 24394 states and 31735 transitions. [2018-04-06 20:09:40,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-06 20:09:40,119 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-04-06 20:09:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:40,175 INFO L225 Difference]: With dead ends: 24394 [2018-04-06 20:09:40,175 INFO L226 Difference]: Without dead ends: 14259 [2018-04-06 20:09:40,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=324, Invalid=936, Unknown=0, NotChecked=0, Total=1260 [2018-04-06 20:09:40,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14259 states. [2018-04-06 20:09:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14259 to 10147. [2018-04-06 20:09:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10147 states. [2018-04-06 20:09:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10147 states to 10147 states and 12490 transitions. [2018-04-06 20:09:40,750 INFO L78 Accepts]: Start accepts. Automaton has 10147 states and 12490 transitions. Word has length 82 [2018-04-06 20:09:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:40,751 INFO L459 AbstractCegarLoop]: Abstraction has 10147 states and 12490 transitions. [2018-04-06 20:09:40,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-06 20:09:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 10147 states and 12490 transitions. [2018-04-06 20:09:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-06 20:09:40,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:40,753 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:40,753 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-06 20:09:40,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1547816782, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:40,759 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:40,800 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 20:09:40,872 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 40 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:41,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:09:41,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 19 [2018-04-06 20:09:41,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-06 20:09:41,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-06 20:09:41,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-04-06 20:09:41,077 INFO L87 Difference]: Start difference. First operand 10147 states and 12490 transitions. Second operand 19 states. [2018-04-06 20:09:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:42,021 INFO L93 Difference]: Finished difference Result 21721 states and 27198 transitions. [2018-04-06 20:09:42,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-06 20:09:42,021 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-04-06 20:09:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:42,049 INFO L225 Difference]: With dead ends: 21721 [2018-04-06 20:09:42,049 INFO L226 Difference]: Without dead ends: 12753 [2018-04-06 20:09:42,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2018-04-06 20:09:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12753 states. [2018-04-06 20:09:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12753 to 10807. [2018-04-06 20:09:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10807 states. [2018-04-06 20:09:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10807 states to 10807 states and 13370 transitions. [2018-04-06 20:09:42,399 INFO L78 Accepts]: Start accepts. Automaton has 10807 states and 13370 transitions. Word has length 86 [2018-04-06 20:09:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:42,399 INFO L459 AbstractCegarLoop]: Abstraction has 10807 states and 13370 transitions. [2018-04-06 20:09:42,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-06 20:09:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10807 states and 13370 transitions. [2018-04-06 20:09:42,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-06 20:09:42,402 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:42,402 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:42,402 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-06 20:09:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash -159603209, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:42,409 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:42,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-06 20:09:42,590 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 36 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-06 20:09:42,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-06 20:09:42,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2018-04-06 20:09:42,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-06 20:09:42,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-06 20:09:42,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-06 20:09:42,688 INFO L87 Difference]: Start difference. First operand 10807 states and 13370 transitions. Second operand 11 states. [2018-04-06 20:09:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:43,003 INFO L93 Difference]: Finished difference Result 14715 states and 18101 transitions. [2018-04-06 20:09:43,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-06 20:09:43,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2018-04-06 20:09:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:43,010 INFO L225 Difference]: With dead ends: 14715 [2018-04-06 20:09:43,010 INFO L226 Difference]: Without dead ends: 3503 [2018-04-06 20:09:43,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-04-06 20:09:43,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2018-04-06 20:09:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 2599. [2018-04-06 20:09:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2599 states. [2018-04-06 20:09:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3180 transitions. [2018-04-06 20:09:43,122 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 3180 transitions. Word has length 88 [2018-04-06 20:09:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:43,122 INFO L459 AbstractCegarLoop]: Abstraction has 2599 states and 3180 transitions. [2018-04-06 20:09:43,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-06 20:09:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3180 transitions. [2018-04-06 20:09:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-06 20:09:43,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:43,125 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:43,125 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-06 20:09:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1651550753, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:43,131 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:43,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 38 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 20:09:43,397 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 40 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:09:43,687 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:09:43,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-04-06 20:09:43,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-06 20:09:43,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-06 20:09:43,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-04-06 20:09:43,688 INFO L87 Difference]: Start difference. First operand 2599 states and 3180 transitions. Second operand 22 states. [2018-04-06 20:09:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:44,970 INFO L93 Difference]: Finished difference Result 7887 states and 10253 transitions. [2018-04-06 20:09:44,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-06 20:09:44,971 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2018-04-06 20:09:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:44,985 INFO L225 Difference]: With dead ends: 7887 [2018-04-06 20:09:44,985 INFO L226 Difference]: Without dead ends: 5344 [2018-04-06 20:09:44,992 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=424, Invalid=1298, Unknown=0, NotChecked=0, Total=1722 [2018-04-06 20:09:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2018-04-06 20:09:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 3463. [2018-04-06 20:09:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2018-04-06 20:09:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4420 transitions. [2018-04-06 20:09:45,268 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4420 transitions. Word has length 109 [2018-04-06 20:09:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:45,269 INFO L459 AbstractCegarLoop]: Abstraction has 3463 states and 4420 transitions. [2018-04-06 20:09:45,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-06 20:09:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4420 transitions. [2018-04-06 20:09:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-04-06 20:09:45,273 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:45,273 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:45,273 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-06 20:09:45,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1349175365, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:45,288 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:45,356 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-04-06 20:09:45,408 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-06 20:09:45,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:09:45,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-06 20:09:45,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-06 20:09:45,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-06 20:09:45,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-04-06 20:09:45,547 INFO L87 Difference]: Start difference. First operand 3463 states and 4420 transitions. Second operand 16 states. [2018-04-06 20:09:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:46,279 INFO L93 Difference]: Finished difference Result 7813 states and 10131 transitions. [2018-04-06 20:09:46,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-06 20:09:46,279 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 118 [2018-04-06 20:09:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:46,287 INFO L225 Difference]: With dead ends: 7813 [2018-04-06 20:09:46,288 INFO L226 Difference]: Without dead ends: 4406 [2018-04-06 20:09:46,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2018-04-06 20:09:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2018-04-06 20:09:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 4311. [2018-04-06 20:09:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2018-04-06 20:09:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 5576 transitions. [2018-04-06 20:09:46,505 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 5576 transitions. Word has length 118 [2018-04-06 20:09:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:46,505 INFO L459 AbstractCegarLoop]: Abstraction has 4311 states and 5576 transitions. [2018-04-06 20:09:46,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-06 20:09:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 5576 transitions. [2018-04-06 20:09:46,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-04-06 20:09:46,509 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:46,509 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:46,509 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-06 20:09:46,509 INFO L82 PathProgramCache]: Analyzing trace with hash 526870510, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:46,537 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:46,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 30 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-04-06 20:09:46,689 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 108 proven. 30 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-04-06 20:09:46,890 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:09:46,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 21 [2018-04-06 20:09:46,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-06 20:09:46,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-06 20:09:46,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-04-06 20:09:46,891 INFO L87 Difference]: Start difference. First operand 4311 states and 5576 transitions. Second operand 21 states. [2018-04-06 20:09:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:47,965 INFO L93 Difference]: Finished difference Result 10003 states and 13164 transitions. [2018-04-06 20:09:47,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-06 20:09:47,966 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 146 [2018-04-06 20:09:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:47,975 INFO L225 Difference]: With dead ends: 10003 [2018-04-06 20:09:47,975 INFO L226 Difference]: Without dead ends: 5748 [2018-04-06 20:09:47,982 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=369, Invalid=1113, Unknown=0, NotChecked=0, Total=1482 [2018-04-06 20:09:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5748 states. [2018-04-06 20:09:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5748 to 4347. [2018-04-06 20:09:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4347 states. [2018-04-06 20:09:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4347 states to 4347 states and 5648 transitions. [2018-04-06 20:09:48,275 INFO L78 Accepts]: Start accepts. Automaton has 4347 states and 5648 transitions. Word has length 146 [2018-04-06 20:09:48,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:48,276 INFO L459 AbstractCegarLoop]: Abstraction has 4347 states and 5648 transitions. [2018-04-06 20:09:48,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-06 20:09:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 4347 states and 5648 transitions. [2018-04-06 20:09:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-06 20:09:48,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:48,280 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:48,280 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-06 20:09:48,280 INFO L82 PathProgramCache]: Analyzing trace with hash -572730924, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:48,296 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:09:48,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:09:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 202 proven. 7 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-04-06 20:09:48,531 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:09:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 136 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-04-06 20:09:48,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:09:48,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-04-06 20:09:48,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-06 20:09:48,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-06 20:09:48,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-06 20:09:48,760 INFO L87 Difference]: Start difference. First operand 4347 states and 5648 transitions. Second operand 16 states. [2018-04-06 20:09:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:09:49,529 INFO L93 Difference]: Finished difference Result 10501 states and 13945 transitions. [2018-04-06 20:09:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-06 20:09:49,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 170 [2018-04-06 20:09:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:09:49,540 INFO L225 Difference]: With dead ends: 10501 [2018-04-06 20:09:49,541 INFO L226 Difference]: Without dead ends: 6210 [2018-04-06 20:09:49,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=632, Unknown=0, NotChecked=0, Total=870 [2018-04-06 20:09:49,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6210 states. [2018-04-06 20:09:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6210 to 5987. [2018-04-06 20:09:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5987 states. [2018-04-06 20:09:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 7810 transitions. [2018-04-06 20:09:49,866 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 7810 transitions. Word has length 170 [2018-04-06 20:09:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:09:49,867 INFO L459 AbstractCegarLoop]: Abstraction has 5987 states and 7810 transitions. [2018-04-06 20:09:49,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-06 20:09:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 7810 transitions. [2018-04-06 20:09:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-06 20:09:49,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:09:49,870 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:09:49,870 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-06 20:09:49,870 INFO L82 PathProgramCache]: Analyzing trace with hash 857657893, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:09:49,875 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:09:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-06 20:09:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-06 20:09:50,206 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-06 20:09:50,334 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-06 20:09:50,354 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-06 20:09:50,356 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-06 20:09:50,357 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-06 20:09:50,358 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-06 20:09:50,359 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-06 20:09:50,360 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-06 20:09:50,365 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-06 20:09:50,366 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-06 20:09:50,367 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-06 20:09:50,367 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-06 20:09:50,368 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-06 20:09:50,373 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-06 20:09:50,374 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-06 20:09:50,374 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-06 20:09:50,375 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-06 20:09:50,376 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-06 20:09:50,376 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-06 20:09:50,377 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-06 20:09:50,381 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-06 20:09:50,381 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-06 20:09:50,382 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-06 20:09:50,383 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-06 20:09:50,383 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-06 20:09:50,384 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-06 20:09:50,384 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-06 20:09:50,385 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-06 20:09:50,385 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-06 20:09:50,389 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-06 20:09:50,389 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-06 20:09:50,390 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-06 20:09:50,390 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-06 20:09:50,391 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-06 20:09:50,391 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-06 20:09:50,392 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-06 20:09:50,393 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-06 20:09:50,393 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-06 20:09:50,394 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-06 20:09:50,394 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-06 20:09:50,395 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-06 20:09:50,398 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-06 20:09:50,398 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-06 20:09:50,399 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-06 20:09:50,400 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-06 20:09:50,400 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-06 20:09:50,401 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-06 20:09:50,401 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-06 20:09:50,402 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-06 20:09:50,402 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-06 20:09:50,403 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-06 20:09:50,403 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-06 20:09:50,404 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-06 20:09:50,404 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-06 20:09:50,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 08:09:50 BoogieIcfgContainer [2018-04-06 20:09:50,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 20:09:50,433 INFO L168 Benchmark]: Toolchain (without parser) took 24849.37 ms. Allocated memory was 299.4 MB in the beginning and 1.3 GB in the end (delta: 959.4 MB). Free memory was 236.4 MB in the beginning and 306.6 MB in the end (delta: -70.2 MB). Peak memory consumption was 889.2 MB. Max. memory is 5.3 GB. [2018-04-06 20:09:50,434 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 299.4 MB. Free memory is still 261.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 20:09:50,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.34 ms. Allocated memory is still 299.4 MB. Free memory was 236.4 MB in the beginning and 209.5 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. [2018-04-06 20:09:50,435 INFO L168 Benchmark]: Boogie Preprocessor took 62.94 ms. Allocated memory is still 299.4 MB. Free memory was 209.5 MB in the beginning and 206.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-06 20:09:50,435 INFO L168 Benchmark]: RCFGBuilder took 638.72 ms. Allocated memory was 299.4 MB in the beginning and 453.5 MB in the end (delta: 154.1 MB). Free memory was 206.5 MB in the beginning and 377.8 MB in the end (delta: -171.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-04-06 20:09:50,436 INFO L168 Benchmark]: TraceAbstraction took 23781.57 ms. Allocated memory was 453.5 MB in the beginning and 1.3 GB in the end (delta: 805.3 MB). Free memory was 376.4 MB in the beginning and 306.6 MB in the end (delta: 69.7 MB). Peak memory consumption was 875.0 MB. Max. memory is 5.3 GB. [2018-04-06 20:09:50,438 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.24 ms. Allocated memory is still 299.4 MB. Free memory is still 261.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 361.34 ms. Allocated memory is still 299.4 MB. Free memory was 236.4 MB in the beginning and 209.5 MB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 62.94 ms. Allocated memory is still 299.4 MB. Free memory was 209.5 MB in the beginning and 206.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 638.72 ms. Allocated memory was 299.4 MB in the beginning and 453.5 MB in the end (delta: 154.1 MB). Free memory was 206.5 MB in the beginning and 377.8 MB in the end (delta: -171.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 23781.57 ms. Allocated memory was 453.5 MB in the beginning and 1.3 GB in the end (delta: 805.3 MB). Free memory was 376.4 MB in the beginning and 306.6 MB in the end (delta: 69.7 MB). Peak memory consumption was 875.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch1 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~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: - UnprovableResult [Line: 688]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 688. Possible FailurePath: [L625] int pc1 = 1; VAL [\old(garbage)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=13, \old(S)=15, \old(t1)=18, \old(t1)=14, \old(t4)=21, \old(t4)=17, \old(x1)=19, \old(x1)=9, \old(x4)=23, \old(x4)=25, garbage={24:16}, pc1=1, pc4=22, res4=12, S={13:15}, t1={18:14}, t4={17:21}, x1={9:19}, x4={23:25}] [L626] int pc4 = 1; VAL [\old(garbage)=16, \old(garbage)=24, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=13, \old(S)=15, \old(t1)=14, \old(t1)=18, \old(t4)=21, \old(t4)=17, \old(x1)=9, \old(x1)=19, \old(x4)=23, \old(x4)=25, garbage={24:16}, pc1=1, pc4=1, res4=12, S={13:15}, t1={18:14}, t4={17:21}, x1={9:19}, x4={23:25}] [L624] struct cell *S; VAL [\old(garbage)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=15, \old(S)=13, \old(t1)=18, \old(t1)=14, \old(t4)=21, \old(t4)=17, \old(x1)=19, \old(x1)=9, \old(x4)=23, \old(x4)=25, garbage={24:16}, pc1=1, pc4=1, res4=12, S={0:0}, t1={18:14}, t4={17:21}, x1={9:19}, x4={23:25}] [L627] static struct cell *t1 = ((void *)0); VAL [\old(garbage)=16, \old(garbage)=24, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=13, \old(S)=15, \old(t1)=18, \old(t1)=14, \old(t4)=17, \old(t4)=21, \old(x1)=9, \old(x1)=19, \old(x4)=25, \old(x4)=23, garbage={24:16}, pc1=1, pc4=1, res4=12, S={0:0}, t1={0:0}, t4={17:21}, x1={9:19}, x4={23:25}] [L628] static struct cell *x1 = ((void *)0); VAL [\old(garbage)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=13, \old(S)=15, \old(t1)=14, \old(t1)=18, \old(t4)=17, \old(t4)=21, \old(x1)=9, \old(x1)=19, \old(x4)=25, \old(x4)=23, garbage={24:16}, pc1=1, pc4=1, res4=12, S={0:0}, t1={0:0}, t4={17:21}, x1={0:0}, x4={23:25}] [L657] struct cell* garbage; VAL [\old(garbage)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=15, \old(S)=13, \old(t1)=14, \old(t1)=18, \old(t4)=21, \old(t4)=17, \old(x1)=9, \old(x1)=19, \old(x4)=25, \old(x4)=23, garbage={0:0}, pc1=1, pc4=1, res4=12, S={0:0}, t1={0:0}, t4={17:21}, x1={0:0}, x4={23:25}] [L658] static struct cell *t4 = ((void *)0); VAL [\old(garbage)=16, \old(garbage)=24, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=15, \old(S)=13, \old(t1)=14, \old(t1)=18, \old(t4)=17, \old(t4)=21, \old(x1)=19, \old(x1)=9, \old(x4)=23, \old(x4)=25, garbage={0:0}, pc1=1, pc4=1, res4=12, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={23:25}] [L659] static struct cell *x4 = ((void *)0); VAL [\old(garbage)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=15, \old(S)=13, \old(t1)=14, \old(t1)=18, \old(t4)=17, \old(t4)=21, \old(x1)=9, \old(x1)=19, \old(x4)=23, \old(x4)=25, garbage={0:0}, pc1=1, pc4=1, res4=12, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L662] static int res4; VAL [\old(garbage)=24, \old(garbage)=16, \old(pc1)=20, \old(pc4)=22, \old(res4)=12, \old(S)=15, \old(S)=13, \old(t1)=14, \old(t1)=18, \old(t4)=21, \old(t4)=17, \old(x1)=9, \old(x1)=19, \old(x4)=25, \old(x4)=23, 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()) 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] 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() 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}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [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++ 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, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L631] pc1++ 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] 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))={43: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))={43:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43: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))={43:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43: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))={43:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43: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={43: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={43: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={43: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={43:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [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)=43, \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={43:0}, x4={0:0}] [L631] pc1++ 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)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc1++=2, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ 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)=43, \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={43:0}, x4={0:0}] [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)=43, \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={43:0}, x4={0:0}] [L632] COND FALSE !(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)=43, \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={43:0}, x4={0:0}] [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)=43, \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={43: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)=43, \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={43: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)=43, \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={43: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={43: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={43: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={43: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={43:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [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)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L631] pc1++ 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)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc1++=3, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ 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)=43, \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={43:0}, x4={0:0}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L632] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [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)=43, \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={43:0}, x4={0:0}] [L637] COND FALSE !(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)=43, \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={43:0}, x4={0:0}] [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=3, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L640] COND TRUE 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)=43, \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={43:0}, x4={0:0}] [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)=43, \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={43: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={43: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={43: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={43: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={43:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [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)=43, \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={43:0}, x4={0:0}] [L631] pc1++ 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)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc1++=4, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ 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)=43, \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={43:0}, x4={0:0}] [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)=43, \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={43:0}, x4={0:0}] [L632] COND FALSE !(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)=43, \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={43:0}, x4={0:0}] [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)=43, \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={43:0}, x4={0:0}] [L637] COND FALSE !(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)=43, \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={43:0}, x4={0:0}] [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)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L640] COND FALSE !(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)=43, \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={43:0}, x4={0:0}] [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L643] COND TRUE case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=4, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43: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)=43, \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={43: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={43: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={43: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={43: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={43:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [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)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L631] pc1++ 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)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc1++=5, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ 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)=43, \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={43:0}, x4={0:0}] [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)=43, \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={43:0}, x4={0:0}] [L632] COND FALSE !(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)=43, \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={43:0}, x4={0:0}] [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L637] COND FALSE !(case 2:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [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)=43, \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={43:0}, x4={0:0}] [L640] COND FALSE !(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)=43, \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={43:0}, x4={0:0}] [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L643] COND FALSE !(case 4:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L646] COND TRUE case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=5, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \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={43:0}, x4={0:0}] [L647] COND TRUE S == t1 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)=43, \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={43:0}, x4={0:0}] [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)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43: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={43:0}, t1={0:0}, t4={0:0}, x1={43: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={43:0}, t1={0:0}, t4={0:0}, x1={43: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={43:0}, t1={0:0}, t4={0:0}, x1={43: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={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L691] COND TRUE __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L692] CALL push() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L632] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L637] COND FALSE !(case 2:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L640] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L640] COND FALSE !(case 3:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L643] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=43, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L643] COND FALSE !(case 4:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L646] case 5: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L646] COND FALSE !(case 5:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L652] case 6: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L652] COND TRUE case 6: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=43, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L653] RET pc1 = 1 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=43, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=43, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43: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={43:0}, t1={0:0}, t4={0:0}, x1={43: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={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND FALSE !(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={43:0}, t1={0:0}, t4={0:0}, x1={43: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, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L690] COND FALSE !(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={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [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={43:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L701] S = ((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}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L702] t1 = ((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}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={43:0}, x4={0:0}] [L703] x1 = ((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}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L704] t4 = ((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}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L705] x4 = ((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}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0: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, 129 locations, 19 error locations. UNSAFE Result, 23.7s OverallTime, 23 OverallIterations, 7 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3601 SDtfs, 11138 SDslu, 9730 SDs, 0 SdLazy, 8155 SolverSat, 1587 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3158 GetRequests, 2760 SyntacticMatches, 11 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2197 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11473occurred in iteration=15, 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: 4.6s AutomataMinimizationTime, 22 MinimizatonAttempts, 16281 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1645 NumberOfCodeBlocks, 1645 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2906 ConstructedInterpolants, 0 QuantifiedInterpolants, 623397 SizeOfPredicates, 125 NumberOfNonLiveVariables, 7500 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 44 InterpolantComputations, 23 PerfectInterpolantSequences, 1618/1922 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_20-09-50-452.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.1_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_20-09-50-452.csv Received shutdown request...