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.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 20:57:42,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 20:57:42,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 20:57:42,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 20:57:42,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 20:57:42,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 20:57:42,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 20:57:42,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 20:57:42,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 20:57:42,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 20:57:42,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 20:57:42,368 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 20:57:42,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 20:57:42,370 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 20:57:42,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 20:57:42,373 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 20:57:42,375 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 20:57:42,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 20:57:42,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 20:57:42,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 20:57:42,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 20:57:42,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 20:57:42,383 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 20:57:42,384 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 20:57:42,385 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 20:57:42,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 20:57:42,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 20:57:42,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 20:57:42,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 20:57:42,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 20:57:42,390 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 20:57:42,390 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-09 20:57:42,415 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 20:57:42,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 20:57:42,415 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 20:57:42,415 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 20:57:42,416 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 20:57:42,416 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 20:57:42,416 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 20:57:42,417 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 20:57:42,417 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 20:57:42,417 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 20:57:42,417 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 20:57:42,417 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 20:57:42,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 20:57:42,418 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 20:57:42,418 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 20:57:42,418 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 20:57:42,418 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 20:57:42,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 20:57:42,418 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 20:57:42,418 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 20:57:42,419 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 20:57:42,419 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 20:57:42,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 20:57:42,419 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 20:57:42,419 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 20:57:42,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 20:57:42,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 20:57:42,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 20:57:42,420 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 20:57:42,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 20:57:42,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 20:57:42,420 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 20:57:42,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:57:42,421 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 20:57:42,422 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 20:57:42,422 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 20:57:42,422 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 20:57:42,422 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 20:57:42,454 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 20:57:42,465 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 20:57:42,468 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 20:57:42,469 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 20:57:42,470 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 20:57:42,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,785 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG03608dd08 [2018-04-09 20:57:42,962 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 20:57:42,962 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 20:57:42,963 INFO L168 CDTParser]: Scanning lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,973 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 20:57:42,973 INFO L215 ultiparseSymbolTable]: [2018-04-09 20:57:42,973 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 20:57:42,973 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__pop ('pop') in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,973 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,974 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flockfree_____false_valid_memtrack_i__push ('push') in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,974 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 20:57:42,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____mode_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____intptr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ssize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__size_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____time_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutexattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____timer_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__mode_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__timer_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____nlink_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__caddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_short in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__gid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc4 in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ssize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_set in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsfilcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_short in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pc1 in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____id_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sig_atomic_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_char in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,977 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fd_mask in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x4 in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_once_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__x1 in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsblkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,978 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blksize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clockid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__div_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_long in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pthread_list_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_cond_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,979 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__blkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__garbage in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____suseconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_char in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__off_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____socklen_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__lldiv_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,980 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__wchar_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_attr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_long in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____off_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrier_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ushort in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,981 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__daddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____sigset_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____pid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint16_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____ino_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____WAIT_STATUS in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____gid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_spinlock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____clock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ulong in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clockid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_int32_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,982 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____loff_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fsid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__fd_mask in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__suseconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlockattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____caddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__clock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____int64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____dev_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsblkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uid_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,983 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__u_quad_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__uint in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__nlink_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_rwlock_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__loff_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__id_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_condattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t1 in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____rlim64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,984 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__dev_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__sigset_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____qaddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blksize_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__t4 in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__register_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____daddr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_barrierattr_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____blkcnt_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,985 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____key_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____u_int in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__S in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____uint8_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__time_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____useconds_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__pthread_mutex_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ino_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i__ldiv_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,986 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____swblk_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:42,987 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flockfree_____false_valid_memtrack_i____fsfilcnt64_t in lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:43,004 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG03608dd08 [2018-04-09 20:57:43,008 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 20:57:43,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 20:57:43,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 20:57:43,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 20:57:43,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 20:57:43,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:57:43" (1/1) ... [2018-04-09 20:57:43,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f4dc83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43, skipping insertion in model container [2018-04-09 20:57:43,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 08:57:43" (1/1) ... [2018-04-09 20:57:43,032 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:57:43,063 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 20:57:43,236 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:57:43,293 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 20:57:43,301 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-09 20:57:43,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43 WrapperNode [2018-04-09 20:57:43,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 20:57:43,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 20:57:43,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 20:57:43,349 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 20:57:43,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43" (1/1) ... [2018-04-09 20:57:43,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43" (1/1) ... [2018-04-09 20:57:43,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43" (1/1) ... [2018-04-09 20:57:43,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43" (1/1) ... [2018-04-09 20:57:43,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43" (1/1) ... [2018-04-09 20:57:43,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43" (1/1) ... [2018-04-09 20:57:43,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43" (1/1) ... [2018-04-09 20:57:43,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 20:57:43,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 20:57:43,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 20:57:43,410 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 20:57:43,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43" (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-09 20:57:43,533 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 20:57:43,533 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 20:57:43,533 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-09 20:57:43,533 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-09 20:57:43,533 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 20:57:43,533 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 20:57:43,533 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 20:57:43,534 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 20:57:43,535 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 20:57:43,535 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 20:57:43,535 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 20:57:43,535 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 20:57:43,535 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 20:57:43,535 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 20:57:43,535 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 20:57:43,535 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 20:57:43,535 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 20:57:43,535 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 20:57:43,536 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 20:57:43,536 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 20:57:43,536 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 20:57:43,536 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 20:57:43,536 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 20:57:43,536 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 20:57:43,536 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 20:57:43,537 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 20:57:43,537 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 20:57:43,537 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 20:57:43,537 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 20:57:43,537 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 20:57:43,537 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 20:57:43,537 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 20:57:43,538 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 20:57:43,538 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 20:57:43,538 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 20:57:43,538 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 20:57:43,538 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 20:57:43,538 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 20:57:43,538 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 20:57:43,538 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 20:57:43,539 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 20:57:43,539 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 20:57:43,539 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 20:57:43,539 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 20:57:43,539 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 20:57:43,539 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 20:57:43,539 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 20:57:43,540 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 20:57:43,540 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 20:57:43,540 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 20:57:43,540 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 20:57:43,540 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 20:57:43,540 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 20:57:43,540 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 20:57:43,540 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 20:57:43,541 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 20:57:43,541 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 20:57:43,541 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 20:57:43,541 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 20:57:43,541 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-09 20:57:43,541 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 20:57:43,541 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 20:57:43,542 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 20:57:43,542 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 20:57:43,542 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 20:57:43,542 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 20:57:43,542 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 20:57:43,542 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 20:57:43,542 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 20:57:43,543 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 20:57:43,543 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 20:57:43,543 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 20:57:43,543 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 20:57:43,543 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 20:57:43,543 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 20:57:43,543 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 20:57:43,543 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 20:57:43,544 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 20:57:43,544 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 20:57:43,544 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 20:57:43,544 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 20:57:43,544 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 20:57:43,544 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 20:57:43,544 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 20:57:43,544 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 20:57:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 20:57:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 20:57:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 20:57:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 20:57:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 20:57:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 20:57:43,545 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 20:57:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 20:57:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 20:57:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 20:57:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 20:57:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 20:57:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__push [2018-04-09 20:57:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 20:57:43,546 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 20:57:43,547 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-09 20:57:43,547 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flockfree_____false_valid_memtrack_i__pop [2018-04-09 20:57:43,547 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-09 20:57:43,547 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 20:57:43,547 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 20:57:43,547 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 20:57:43,547 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 20:57:43,547 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 20:57:43,548 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 20:57:44,063 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 20:57:44,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:57:44 BoogieIcfgContainer [2018-04-09 20:57:44,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 20:57:44,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 20:57:44,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 20:57:44,068 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 20:57:44,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 08:57:43" (1/3) ... [2018-04-09 20:57:44,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e38b67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:57:44, skipping insertion in model container [2018-04-09 20:57:44,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 08:57:43" (2/3) ... [2018-04-09 20:57:44,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e38b67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 08:57:44, skipping insertion in model container [2018-04-09 20:57:44,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 08:57:44" (3/3) ... [2018-04-09 20:57:44,071 INFO L107 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-04-09 20:57:44,081 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 20:57:44,090 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-04-09 20:57:44,138 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 20:57:44,139 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 20:57:44,139 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 20:57:44,139 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 20:57:44,139 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 20:57:44,139 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 20:57:44,139 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 20:57:44,139 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 20:57:44,139 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 20:57:44,140 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 20:57:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2018-04-09 20:57:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-09 20:57:44,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:44,164 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-09 20:57:44,164 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-09 20:57:44,167 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-09 20:57:44,179 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:44,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:44,253 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-09 20:57:44,254 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:44,286 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-09 20:57:44,312 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:44,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 20:57:44,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-09 20:57:44,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-09 20:57:44,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-09 20:57:44,326 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2018-04-09 20:57:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:44,354 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2018-04-09 20:57:44,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-09 20:57:44,355 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-04-09 20:57:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:44,370 INFO L225 Difference]: With dead ends: 153 [2018-04-09 20:57:44,370 INFO L226 Difference]: Without dead ends: 126 [2018-04-09 20:57:44,374 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-09 20:57:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-09 20:57:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-09 20:57:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-09 20:57:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2018-04-09 20:57:44,416 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 19 [2018-04-09 20:57:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:44,416 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2018-04-09 20:57:44,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-09 20:57:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2018-04-09 20:57:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-09 20:57:44,418 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:44,418 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-09 20:57:44,418 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-09 20:57:44,418 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-09 20:57:44,428 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:44,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:44,493 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-09 20:57:44,494 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:44,506 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-09 20:57:44,528 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:44,528 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:57:44,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 20:57:44,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 20:57:44,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:57:44,530 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 3 states. [2018-04-09 20:57:44,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:44,554 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2018-04-09 20:57:44,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 20:57:44,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-09 20:57:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:44,556 INFO L225 Difference]: With dead ends: 150 [2018-04-09 20:57:44,556 INFO L226 Difference]: Without dead ends: 127 [2018-04-09 20:57:44,557 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-09 20:57:44,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-09 20:57:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-04-09 20:57:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-09 20:57:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2018-04-09 20:57:44,566 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 24 [2018-04-09 20:57:44,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:44,567 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2018-04-09 20:57:44,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 20:57:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2018-04-09 20:57:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-09 20:57:44,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:44,568 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-09 20:57:44,568 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-09 20:57:44,568 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-09 20:57:44,575 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:44,617 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:44,652 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-09 20:57:44,653 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:44,686 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-09 20:57:44,722 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:44,722 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:57:44,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 20:57:44,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 20:57:44,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:57:44,723 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 3 states. [2018-04-09 20:57:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:44,774 INFO L93 Difference]: Finished difference Result 240 states and 276 transitions. [2018-04-09 20:57:44,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 20:57:44,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-04-09 20:57:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:44,778 INFO L225 Difference]: With dead ends: 240 [2018-04-09 20:57:44,778 INFO L226 Difference]: Without dead ends: 219 [2018-04-09 20:57:44,779 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-09 20:57:44,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-09 20:57:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2018-04-09 20:57:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-09 20:57:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 245 transitions. [2018-04-09 20:57:44,802 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 245 transitions. Word has length 26 [2018-04-09 20:57:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:44,803 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 245 transitions. [2018-04-09 20:57:44,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 20:57:44,803 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 245 transitions. [2018-04-09 20:57:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 20:57:44,804 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:44,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] [2018-04-09 20:57:44,804 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-09 20:57:44,805 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-09 20:57:44,826 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:44,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:44,914 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-09 20:57:44,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:57:44,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:57:44,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 20:57:44,932 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-09 20:57:44,932 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:44,942 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-09 20:57:44,978 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:44,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 20:57:44,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 20:57:44,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 20:57:44,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 20:57:44,980 INFO L87 Difference]: Start difference. First operand 200 states and 245 transitions. Second operand 4 states. [2018-04-09 20:57:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:45,178 INFO L93 Difference]: Finished difference Result 375 states and 466 transitions. [2018-04-09 20:57:45,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 20:57:45,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-09 20:57:45,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:45,182 INFO L225 Difference]: With dead ends: 375 [2018-04-09 20:57:45,182 INFO L226 Difference]: Without dead ends: 371 [2018-04-09 20:57:45,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-09 20:57:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-09 20:57:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 334. [2018-04-09 20:57:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-04-09 20:57:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 426 transitions. [2018-04-09 20:57:45,206 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 426 transitions. Word has length 32 [2018-04-09 20:57:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:45,207 INFO L459 AbstractCegarLoop]: Abstraction has 334 states and 426 transitions. [2018-04-09 20:57:45,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 20:57:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 426 transitions. [2018-04-09 20:57:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 20:57:45,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:45,208 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-09 20:57:45,208 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-09 20:57:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash -251404698, 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-09 20:57:45,214 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:45,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:45,286 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-09 20:57:45,286 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:45,351 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-09 20:57:45,374 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:45,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-09 20:57:45,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 20:57:45,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 20:57:45,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-09 20:57:45,375 INFO L87 Difference]: Start difference. First operand 334 states and 426 transitions. Second operand 5 states. [2018-04-09 20:57:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:45,521 INFO L93 Difference]: Finished difference Result 988 states and 1266 transitions. [2018-04-09 20:57:45,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 20:57:45,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-09 20:57:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:45,528 INFO L225 Difference]: With dead ends: 988 [2018-04-09 20:57:45,528 INFO L226 Difference]: Without dead ends: 669 [2018-04-09 20:57:45,531 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-09 20:57:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-04-09 20:57:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 502. [2018-04-09 20:57:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-04-09 20:57:45,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 652 transitions. [2018-04-09 20:57:45,570 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 652 transitions. Word has length 32 [2018-04-09 20:57:45,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:45,570 INFO L459 AbstractCegarLoop]: Abstraction has 502 states and 652 transitions. [2018-04-09 20:57:45,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 20:57:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 652 transitions. [2018-04-09 20:57:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-09 20:57:45,571 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:45,571 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-09 20:57:45,571 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-09 20:57:45,572 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 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-09 20:57:45,579 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:45,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:45,628 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-09 20:57:45,628 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:45,659 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:45,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 20:57:45,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 20:57:45,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 20:57:45,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 20:57:45,660 INFO L87 Difference]: Start difference. First operand 502 states and 652 transitions. Second operand 3 states. [2018-04-09 20:57:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:45,749 INFO L93 Difference]: Finished difference Result 562 states and 729 transitions. [2018-04-09 20:57:45,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 20:57:45,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-04-09 20:57:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:45,753 INFO L225 Difference]: With dead ends: 562 [2018-04-09 20:57:45,753 INFO L226 Difference]: Without dead ends: 550 [2018-04-09 20:57:45,754 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-09 20:57:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-04-09 20:57:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 537. [2018-04-09 20:57:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-04-09 20:57:45,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 700 transitions. [2018-04-09 20:57:45,781 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 700 transitions. Word has length 32 [2018-04-09 20:57:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:45,782 INFO L459 AbstractCegarLoop]: Abstraction has 537 states and 700 transitions. [2018-04-09 20:57:45,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 20:57:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 700 transitions. [2018-04-09 20:57:45,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 20:57:45,783 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:45,783 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-09 20:57:45,783 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-09 20:57:45,783 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-09 20:57:45,796 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:45,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:45,853 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-09 20:57:45,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:57:45,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:57:45,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 20:57:45,919 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-09 20:57:45,919 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:45,938 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-09 20:57:45,960 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:45,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 20:57:45,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 20:57:45,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 20:57:45,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 20:57:45,961 INFO L87 Difference]: Start difference. First operand 537 states and 700 transitions. Second operand 6 states. [2018-04-09 20:57:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:46,162 INFO L93 Difference]: Finished difference Result 843 states and 1079 transitions. [2018-04-09 20:57:46,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 20:57:46,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-09 20:57:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:46,168 INFO L225 Difference]: With dead ends: 843 [2018-04-09 20:57:46,168 INFO L226 Difference]: Without dead ends: 839 [2018-04-09 20:57:46,169 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-09 20:57:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-04-09 20:57:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 780. [2018-04-09 20:57:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2018-04-09 20:57:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1021 transitions. [2018-04-09 20:57:46,213 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1021 transitions. Word has length 34 [2018-04-09 20:57:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:46,214 INFO L459 AbstractCegarLoop]: Abstraction has 780 states and 1021 transitions. [2018-04-09 20:57:46,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 20:57:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1021 transitions. [2018-04-09 20:57:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-09 20:57:46,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:46,215 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-09 20:57:46,215 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-09 20:57:46,216 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-09 20:57:46,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:46,275 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:46,392 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-09 20:57:46,392 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:46,571 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-09 20:57:46,606 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:46,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2018-04-09 20:57:46,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 20:57:46,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 20:57:46,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-09 20:57:46,607 INFO L87 Difference]: Start difference. First operand 780 states and 1021 transitions. Second operand 11 states. [2018-04-09 20:57:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:46,819 INFO L93 Difference]: Finished difference Result 1929 states and 2567 transitions. [2018-04-09 20:57:46,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 20:57:46,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-04-09 20:57:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:46,824 INFO L225 Difference]: With dead ends: 1929 [2018-04-09 20:57:46,824 INFO L226 Difference]: Without dead ends: 1242 [2018-04-09 20:57:46,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-04-09 20:57:46,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2018-04-09 20:57:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1228. [2018-04-09 20:57:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2018-04-09 20:57:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1599 transitions. [2018-04-09 20:57:46,876 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1599 transitions. Word has length 34 [2018-04-09 20:57:46,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:46,876 INFO L459 AbstractCegarLoop]: Abstraction has 1228 states and 1599 transitions. [2018-04-09 20:57:46,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 20:57:46,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1599 transitions. [2018-04-09 20:57:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 20:57:46,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:46,878 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-09 20:57:46,878 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-09 20:57:46,878 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-09 20:57:46,886 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:46,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:47,069 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-09 20:57:47,069 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:47,175 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-09 20:57:47,197 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:47,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-09 20:57:47,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:57:47,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:57:47,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:57:47,198 INFO L87 Difference]: Start difference. First operand 1228 states and 1599 transitions. Second operand 9 states. [2018-04-09 20:57:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:47,853 INFO L93 Difference]: Finished difference Result 4701 states and 6093 transitions. [2018-04-09 20:57:47,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 20:57:47,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-09 20:57:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:47,867 INFO L225 Difference]: With dead ends: 4701 [2018-04-09 20:57:47,867 INFO L226 Difference]: Without dead ends: 3488 [2018-04-09 20:57:47,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-09 20:57:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2018-04-09 20:57:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3334. [2018-04-09 20:57:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3334 states. [2018-04-09 20:57:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4215 transitions. [2018-04-09 20:57:48,020 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4215 transitions. Word has length 36 [2018-04-09 20:57:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:48,020 INFO L459 AbstractCegarLoop]: Abstraction has 3334 states and 4215 transitions. [2018-04-09 20:57:48,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:57:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4215 transitions. [2018-04-09 20:57:48,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 20:57:48,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:48,022 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-09 20:57:48,022 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-09 20:57:48,022 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-09 20:57:48,028 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:48,069 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:48,280 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-09 20:57:48,280 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:48,542 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-09 20:57:48,575 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:48,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2018-04-09 20:57:48,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 20:57:48,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 20:57:48,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-09 20:57:48,576 INFO L87 Difference]: Start difference. First operand 3334 states and 4215 transitions. Second operand 9 states. [2018-04-09 20:57:49,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:49,038 INFO L93 Difference]: Finished difference Result 7467 states and 9528 transitions. [2018-04-09 20:57:49,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 20:57:49,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-04-09 20:57:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:49,062 INFO L225 Difference]: With dead ends: 7467 [2018-04-09 20:57:49,062 INFO L226 Difference]: Without dead ends: 4360 [2018-04-09 20:57:49,071 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-09 20:57:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2018-04-09 20:57:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 4222. [2018-04-09 20:57:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4222 states. [2018-04-09 20:57:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4222 states to 4222 states and 5303 transitions. [2018-04-09 20:57:49,299 INFO L78 Accepts]: Start accepts. Automaton has 4222 states and 5303 transitions. Word has length 54 [2018-04-09 20:57:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:49,300 INFO L459 AbstractCegarLoop]: Abstraction has 4222 states and 5303 transitions. [2018-04-09 20:57:49,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 20:57:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 4222 states and 5303 transitions. [2018-04-09 20:57:49,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-09 20:57:49,301 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:49,301 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-09 20:57:49,301 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-09 20:57:49,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1435809972, 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-09 20:57:49,311 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:49,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:49,525 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:49,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:49,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-04-09 20:57:49,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 20:57:49,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 20:57:49,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:57:49,758 INFO L87 Difference]: Start difference. First operand 4222 states and 5303 transitions. Second operand 13 states. [2018-04-09 20:57:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:50,610 INFO L93 Difference]: Finished difference Result 13049 states and 16418 transitions. [2018-04-09 20:57:50,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-09 20:57:50,611 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-04-09 20:57:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:50,662 INFO L225 Difference]: With dead ends: 13049 [2018-04-09 20:57:50,662 INFO L226 Difference]: Without dead ends: 8842 [2018-04-09 20:57:50,679 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=625, Unknown=0, NotChecked=0, Total=870 [2018-04-09 20:57:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-04-09 20:57:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 7296. [2018-04-09 20:57:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2018-04-09 20:57:51,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 8931 transitions. [2018-04-09 20:57:51,095 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 8931 transitions. Word has length 59 [2018-04-09 20:57:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:51,095 INFO L459 AbstractCegarLoop]: Abstraction has 7296 states and 8931 transitions. [2018-04-09 20:57:51,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 20:57:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 8931 transitions. [2018-04-09 20:57:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-09 20:57:51,097 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:51,097 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-09 20:57:51,097 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:57:51,097 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-09 20:57:51,106 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:51,161 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:51,276 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-09 20:57:51,277 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:51,420 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-09 20:57:51,445 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 20:57:51,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2018-04-09 20:57:51,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 20:57:51,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 20:57:51,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-04-09 20:57:51,446 INFO L87 Difference]: Start difference. First operand 7296 states and 8931 transitions. Second operand 11 states. [2018-04-09 20:57:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:51,899 INFO L93 Difference]: Finished difference Result 9653 states and 11715 transitions. [2018-04-09 20:57:51,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 20:57:51,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-04-09 20:57:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:51,913 INFO L225 Difference]: With dead ends: 9653 [2018-04-09 20:57:51,913 INFO L226 Difference]: Without dead ends: 2496 [2018-04-09 20:57:51,930 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2018-04-09 20:57:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2018-04-09 20:57:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2389. [2018-04-09 20:57:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2018-04-09 20:57:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 2864 transitions. [2018-04-09 20:57:52,080 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 2864 transitions. Word has length 62 [2018-04-09 20:57:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:52,080 INFO L459 AbstractCegarLoop]: Abstraction has 2389 states and 2864 transitions. [2018-04-09 20:57:52,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 20:57:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 2864 transitions. [2018-04-09 20:57:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-09 20:57:52,082 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:52,082 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:57:52,083 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-09 20:57:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1481701379, 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-09 20:57:52,092 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:52,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:52,215 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:52,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:52,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-04-09 20:57:52,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 20:57:52,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 20:57:52,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:57:52,441 INFO L87 Difference]: Start difference. First operand 2389 states and 2864 transitions. Second operand 10 states. [2018-04-09 20:57:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:53,252 INFO L93 Difference]: Finished difference Result 10619 states and 13269 transitions. [2018-04-09 20:57:53,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-09 20:57:53,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2018-04-09 20:57:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:53,281 INFO L225 Difference]: With dead ends: 10619 [2018-04-09 20:57:53,281 INFO L226 Difference]: Without dead ends: 8245 [2018-04-09 20:57:53,289 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:57:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2018-04-09 20:57:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 7581. [2018-04-09 20:57:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7581 states. [2018-04-09 20:57:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7581 states to 7581 states and 9265 transitions. [2018-04-09 20:57:53,544 INFO L78 Accepts]: Start accepts. Automaton has 7581 states and 9265 transitions. Word has length 76 [2018-04-09 20:57:53,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:53,544 INFO L459 AbstractCegarLoop]: Abstraction has 7581 states and 9265 transitions. [2018-04-09 20:57:53,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 20:57:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 7581 states and 9265 transitions. [2018-04-09 20:57:53,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-09 20:57:53,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:53,546 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-09 20:57:53,546 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-09 20:57:53,546 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 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-09 20:57:53,566 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:53,612 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:53,957 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-09 20:57:53,957 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:54,165 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-09 20:57:54,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:54,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-09 20:57:54,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 20:57:54,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 20:57:54,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:57:54,188 INFO L87 Difference]: Start difference. First operand 7581 states and 9265 transitions. Second operand 16 states. [2018-04-09 20:57:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:54,987 INFO L93 Difference]: Finished difference Result 17954 states and 22306 transitions. [2018-04-09 20:57:54,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 20:57:54,988 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-04-09 20:57:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:55,031 INFO L225 Difference]: With dead ends: 17954 [2018-04-09 20:57:55,031 INFO L226 Difference]: Without dead ends: 12247 [2018-04-09 20:57:55,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=754, Unknown=0, NotChecked=0, Total=992 [2018-04-09 20:57:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12247 states. [2018-04-09 20:57:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12247 to 10393. [2018-04-09 20:57:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2018-04-09 20:57:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 12949 transitions. [2018-04-09 20:57:55,563 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 12949 transitions. Word has length 81 [2018-04-09 20:57:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:55,563 INFO L459 AbstractCegarLoop]: Abstraction has 10393 states and 12949 transitions. [2018-04-09 20:57:55,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 20:57:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 12949 transitions. [2018-04-09 20:57:55,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-09 20:57:55,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:55,567 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-09 20:57:55,567 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-09 20:57:55,567 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 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-09 20:57:55,578 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:55,642 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:55,765 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-09 20:57:55,766 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:55,899 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-09 20:57:55,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:55,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-04-09 20:57:55,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 20:57:55,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 20:57:55,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-09 20:57:55,932 INFO L87 Difference]: Start difference. First operand 10393 states and 12949 transitions. Second operand 17 states. [2018-04-09 20:57:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:57,172 INFO L93 Difference]: Finished difference Result 22682 states and 29708 transitions. [2018-04-09 20:57:57,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-09 20:57:57,173 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-04-09 20:57:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:57,203 INFO L225 Difference]: With dead ends: 22682 [2018-04-09 20:57:57,203 INFO L226 Difference]: Without dead ends: 14163 [2018-04-09 20:57:57,217 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=994, Unknown=0, NotChecked=0, Total=1332 [2018-04-09 20:57:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14163 states. [2018-04-09 20:57:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14163 to 9121. [2018-04-09 20:57:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2018-04-09 20:57:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 11355 transitions. [2018-04-09 20:57:57,543 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 11355 transitions. Word has length 82 [2018-04-09 20:57:57,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:57,543 INFO L459 AbstractCegarLoop]: Abstraction has 9121 states and 11355 transitions. [2018-04-09 20:57:57,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 20:57:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 11355 transitions. [2018-04-09 20:57:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-09 20:57:57,545 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:57,545 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-09 20:57:57,545 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-09 20:57:57,545 INFO L82 PathProgramCache]: Analyzing trace with hash 476919487, 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-09 20:57:57,552 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:57,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:57,779 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:57,891 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:57,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-04-09 20:57:57,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 20:57:57,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 20:57:57,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:57:57,892 INFO L87 Difference]: Start difference. First operand 9121 states and 11355 transitions. Second operand 13 states. [2018-04-09 20:57:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:58,466 INFO L93 Difference]: Finished difference Result 18243 states and 22674 transitions. [2018-04-09 20:57:58,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-09 20:57:58,467 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2018-04-09 20:57:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:57:58,485 INFO L225 Difference]: With dead ends: 18243 [2018-04-09 20:57:58,485 INFO L226 Difference]: Without dead ends: 8957 [2018-04-09 20:57:58,507 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2018-04-09 20:57:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2018-04-09 20:57:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 8761. [2018-04-09 20:57:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8761 states. [2018-04-09 20:57:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8761 states to 8761 states and 10911 transitions. [2018-04-09 20:57:58,902 INFO L78 Accepts]: Start accepts. Automaton has 8761 states and 10911 transitions. Word has length 83 [2018-04-09 20:57:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:57:58,903 INFO L459 AbstractCegarLoop]: Abstraction has 8761 states and 10911 transitions. [2018-04-09 20:57:58,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 20:57:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 8761 states and 10911 transitions. [2018-04-09 20:57:58,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-09 20:57:58,905 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:57:58,906 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, 1, 1, 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-09 20:57:58,906 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-09 20:57:58,906 INFO L82 PathProgramCache]: Analyzing trace with hash 193067153, 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-09 20:57:58,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:57:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:57:58,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:57:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-09 20:57:59,027 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:57:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 20:57:59,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:57:59,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2018-04-09 20:57:59,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 20:57:59,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 20:57:59,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-04-09 20:57:59,183 INFO L87 Difference]: Start difference. First operand 8761 states and 10911 transitions. Second operand 17 states. [2018-04-09 20:57:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:57:59,988 INFO L93 Difference]: Finished difference Result 21585 states and 27348 transitions. [2018-04-09 20:57:59,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 20:57:59,988 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-04-09 20:57:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:00,030 INFO L225 Difference]: With dead ends: 21585 [2018-04-09 20:58:00,030 INFO L226 Difference]: Without dead ends: 12676 [2018-04-09 20:58:00,049 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=252, Invalid=678, Unknown=0, NotChecked=0, Total=930 [2018-04-09 20:58:00,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12676 states. [2018-04-09 20:58:00,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12676 to 10640. [2018-04-09 20:58:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10640 states. [2018-04-09 20:58:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10640 states to 10640 states and 13496 transitions. [2018-04-09 20:58:00,492 INFO L78 Accepts]: Start accepts. Automaton has 10640 states and 13496 transitions. Word has length 88 [2018-04-09 20:58:00,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:00,493 INFO L459 AbstractCegarLoop]: Abstraction has 10640 states and 13496 transitions. [2018-04-09 20:58:00,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 20:58:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 10640 states and 13496 transitions. [2018-04-09 20:58:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-09 20:58:00,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:00,496 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:58:00,496 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-09 20:58:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash -242131558, 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-09 20:58:00,507 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:00,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-09 20:58:00,666 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-04-09 20:58:00,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:58:00,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-04-09 20:58:00,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 20:58:00,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 20:58:00,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:58:00,798 INFO L87 Difference]: Start difference. First operand 10640 states and 13496 transitions. Second operand 13 states. [2018-04-09 20:58:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:02,709 INFO L93 Difference]: Finished difference Result 43420 states and 57079 transitions. [2018-04-09 20:58:02,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-09 20:58:02,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2018-04-09 20:58:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:02,770 INFO L225 Difference]: With dead ends: 43420 [2018-04-09 20:58:02,770 INFO L226 Difference]: Without dead ends: 32795 [2018-04-09 20:58:02,788 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=566, Unknown=0, NotChecked=0, Total=756 [2018-04-09 20:58:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32795 states. [2018-04-09 20:58:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32795 to 26574. [2018-04-09 20:58:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26574 states. [2018-04-09 20:58:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26574 states to 26574 states and 34015 transitions. [2018-04-09 20:58:03,907 INFO L78 Accepts]: Start accepts. Automaton has 26574 states and 34015 transitions. Word has length 92 [2018-04-09 20:58:03,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:03,908 INFO L459 AbstractCegarLoop]: Abstraction has 26574 states and 34015 transitions. [2018-04-09 20:58:03,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 20:58:03,908 INFO L276 IsEmpty]: Start isEmpty. Operand 26574 states and 34015 transitions. [2018-04-09 20:58:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-04-09 20:58:03,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:03,911 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:58:03,911 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-09 20:58:03,911 INFO L82 PathProgramCache]: Analyzing trace with hash 828783997, 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-09 20:58:03,927 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:03,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-04-09 20:58:04,007 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 40 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-09 20:58:04,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-09 20:58:04,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2018-04-09 20:58:04,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 20:58:04,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 20:58:04,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-09 20:58:04,117 INFO L87 Difference]: Start difference. First operand 26574 states and 34015 transitions. Second operand 10 states. [2018-04-09 20:58:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:04,786 INFO L93 Difference]: Finished difference Result 42804 states and 54563 transitions. [2018-04-09 20:58:04,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-09 20:58:04,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2018-04-09 20:58:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:04,935 INFO L225 Difference]: With dead ends: 42804 [2018-04-09 20:58:04,935 INFO L226 Difference]: Without dead ends: 15165 [2018-04-09 20:58:04,957 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-04-09 20:58:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15165 states. [2018-04-09 20:58:05,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15165 to 13511. [2018-04-09 20:58:05,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13511 states. [2018-04-09 20:58:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13511 states to 13511 states and 17389 transitions. [2018-04-09 20:58:05,430 INFO L78 Accepts]: Start accepts. Automaton has 13511 states and 17389 transitions. Word has length 92 [2018-04-09 20:58:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:05,431 INFO L459 AbstractCegarLoop]: Abstraction has 13511 states and 17389 transitions. [2018-04-09 20:58:05,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 20:58:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 13511 states and 17389 transitions. [2018-04-09 20:58:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-09 20:58:05,433 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:05,433 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-09 20:58:05,433 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-09 20:58:05,433 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 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-09 20:58:05,448 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:05,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:05,569 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-09 20:58:05,569 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:05,741 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-09 20:58:05,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:58:05,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2018-04-09 20:58:05,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-09 20:58:05,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-09 20:58:05,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-04-09 20:58:05,764 INFO L87 Difference]: Start difference. First operand 13511 states and 17389 transitions. Second operand 22 states. [2018-04-09 20:58:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:07,803 INFO L93 Difference]: Finished difference Result 42066 states and 57162 transitions. [2018-04-09 20:58:07,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-09 20:58:07,803 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2018-04-09 20:58:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:07,861 INFO L225 Difference]: With dead ends: 42066 [2018-04-09 20:58:07,862 INFO L226 Difference]: Without dead ends: 28611 [2018-04-09 20:58:07,884 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=433, Invalid=1373, Unknown=0, NotChecked=0, Total=1806 [2018-04-09 20:58:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28611 states. [2018-04-09 20:58:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28611 to 18527. [2018-04-09 20:58:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18527 states. [2018-04-09 20:58:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18527 states to 18527 states and 25001 transitions. [2018-04-09 20:58:08,883 INFO L78 Accepts]: Start accepts. Automaton has 18527 states and 25001 transitions. Word has length 109 [2018-04-09 20:58:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:08,884 INFO L459 AbstractCegarLoop]: Abstraction has 18527 states and 25001 transitions. [2018-04-09 20:58:08,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-09 20:58:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 18527 states and 25001 transitions. [2018-04-09 20:58:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-04-09 20:58:08,886 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:08,887 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-09 20:58:08,887 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-09 20:58:08,887 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 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-09 20:58:08,893 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:08,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:09,027 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-09 20:58:09,027 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:09,138 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-09 20:58:09,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:58:09,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-04-09 20:58:09,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 20:58:09,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 20:58:09,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:58:09,160 INFO L87 Difference]: Start difference. First operand 18527 states and 25001 transitions. Second operand 16 states. [2018-04-09 20:58:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:10,789 INFO L93 Difference]: Finished difference Result 42030 states and 57210 transitions. [2018-04-09 20:58:10,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-09 20:58:10,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 118 [2018-04-09 20:58:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:10,828 INFO L225 Difference]: With dead ends: 42030 [2018-04-09 20:58:10,828 INFO L226 Difference]: Without dead ends: 23559 [2018-04-09 20:58:10,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2018-04-09 20:58:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23559 states. [2018-04-09 20:58:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23559 to 23191. [2018-04-09 20:58:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23191 states. [2018-04-09 20:58:12,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23191 states to 23191 states and 31381 transitions. [2018-04-09 20:58:12,114 INFO L78 Accepts]: Start accepts. Automaton has 23191 states and 31381 transitions. Word has length 118 [2018-04-09 20:58:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:12,114 INFO L459 AbstractCegarLoop]: Abstraction has 23191 states and 31381 transitions. [2018-04-09 20:58:12,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 20:58:12,114 INFO L276 IsEmpty]: Start isEmpty. Operand 23191 states and 31381 transitions. [2018-04-09 20:58:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-04-09 20:58:12,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:12,117 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-09 20:58:12,118 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-09 20:58:12,118 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 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-09 20:58:12,125 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:12,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:12,251 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-09 20:58:12,251 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:12,424 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-09 20:58:12,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:58:12,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 21 [2018-04-09 20:58:12,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 20:58:12,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 20:58:12,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-04-09 20:58:12,445 INFO L87 Difference]: Start difference. First operand 23191 states and 31381 transitions. Second operand 21 states. [2018-04-09 20:58:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:14,735 INFO L93 Difference]: Finished difference Result 54072 states and 74254 transitions. [2018-04-09 20:58:14,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-09 20:58:14,736 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 146 [2018-04-09 20:58:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:14,781 INFO L225 Difference]: With dead ends: 54072 [2018-04-09 20:58:14,781 INFO L226 Difference]: Without dead ends: 30937 [2018-04-09 20:58:14,804 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=1182, Unknown=0, NotChecked=0, Total=1560 [2018-04-09 20:58:14,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30937 states. [2018-04-09 20:58:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30937 to 23367. [2018-04-09 20:58:15,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23367 states. [2018-04-09 20:58:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23367 states to 23367 states and 31733 transitions. [2018-04-09 20:58:15,895 INFO L78 Accepts]: Start accepts. Automaton has 23367 states and 31733 transitions. Word has length 146 [2018-04-09 20:58:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:15,896 INFO L459 AbstractCegarLoop]: Abstraction has 23367 states and 31733 transitions. [2018-04-09 20:58:15,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 20:58:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 23367 states and 31733 transitions. [2018-04-09 20:58:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-09 20:58:15,898 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:15,898 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-09 20:58:15,898 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-09 20:58:15,898 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 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-09 20:58:15,904 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:15,964 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:16,029 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-09 20:58:16,029 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:16,159 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-09 20:58:16,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:58:16,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-04-09 20:58:16,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 20:58:16,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 20:58:16,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:58:16,181 INFO L87 Difference]: Start difference. First operand 23367 states and 31733 transitions. Second operand 16 states. [2018-04-09 20:58:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:18,554 INFO L93 Difference]: Finished difference Result 56312 states and 77694 transitions. [2018-04-09 20:58:18,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 20:58:18,555 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 170 [2018-04-09 20:58:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:18,614 INFO L225 Difference]: With dead ends: 56312 [2018-04-09 20:58:18,614 INFO L226 Difference]: Without dead ends: 33001 [2018-04-09 20:58:18,651 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 329 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2018-04-09 20:58:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33001 states. [2018-04-09 20:58:20,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33001 to 32695. [2018-04-09 20:58:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32695 states. [2018-04-09 20:58:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32695 states to 32695 states and 44581 transitions. [2018-04-09 20:58:20,317 INFO L78 Accepts]: Start accepts. Automaton has 32695 states and 44581 transitions. Word has length 170 [2018-04-09 20:58:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:20,318 INFO L459 AbstractCegarLoop]: Abstraction has 32695 states and 44581 transitions. [2018-04-09 20:58:20,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 20:58:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand 32695 states and 44581 transitions. [2018-04-09 20:58:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-04-09 20:58:20,320 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:20,320 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-09 20:58:20,320 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:58:20,321 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:58:20,327 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:20,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 87 proven. 107 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-04-09 20:58:20,484 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 81 proven. 113 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-04-09 20:58:20,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:58:20,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-04-09 20:58:20,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 20:58:20,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 20:58:20,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-09 20:58:20,620 INFO L87 Difference]: Start difference. First operand 32695 states and 44581 transitions. Second operand 12 states. [2018-04-09 20:58:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:22,947 INFO L93 Difference]: Finished difference Result 76927 states and 104993 transitions. [2018-04-09 20:58:22,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 20:58:22,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 170 [2018-04-09 20:58:22,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:23,032 INFO L225 Difference]: With dead ends: 76927 [2018-04-09 20:58:23,032 INFO L226 Difference]: Without dead ends: 44288 [2018-04-09 20:58:23,076 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-04-09 20:58:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44288 states. [2018-04-09 20:58:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44288 to 43695. [2018-04-09 20:58:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43695 states. [2018-04-09 20:58:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43695 states to 43695 states and 59675 transitions. [2018-04-09 20:58:25,311 INFO L78 Accepts]: Start accepts. Automaton has 43695 states and 59675 transitions. Word has length 170 [2018-04-09 20:58:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:25,312 INFO L459 AbstractCegarLoop]: Abstraction has 43695 states and 59675 transitions. [2018-04-09 20:58:25,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 20:58:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 43695 states and 59675 transitions. [2018-04-09 20:58:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-09 20:58:25,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:25,315 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, 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] [2018-04-09 20:58:25,315 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:58:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1130216723, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:58:25,336 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:25,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 208 proven. 10 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-04-09 20:58:25,481 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 156 proven. 36 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-04-09 20:58:25,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:58:25,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-09 20:58:25,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 20:58:25,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 20:58:25,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-04-09 20:58:25,701 INFO L87 Difference]: Start difference. First operand 43695 states and 59675 transitions. Second operand 15 states. [2018-04-09 20:58:28,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:28,797 INFO L93 Difference]: Finished difference Result 100204 states and 137062 transitions. [2018-04-09 20:58:28,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 20:58:28,797 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 172 [2018-04-09 20:58:28,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:28,943 INFO L225 Difference]: With dead ends: 100204 [2018-04-09 20:58:28,943 INFO L226 Difference]: Without dead ends: 56565 [2018-04-09 20:58:29,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2018-04-09 20:58:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56565 states. [2018-04-09 20:58:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56565 to 50015. [2018-04-09 20:58:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50015 states. [2018-04-09 20:58:31,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50015 states to 50015 states and 68117 transitions. [2018-04-09 20:58:31,654 INFO L78 Accepts]: Start accepts. Automaton has 50015 states and 68117 transitions. Word has length 172 [2018-04-09 20:58:31,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:31,654 INFO L459 AbstractCegarLoop]: Abstraction has 50015 states and 68117 transitions. [2018-04-09 20:58:31,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 20:58:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 50015 states and 68117 transitions. [2018-04-09 20:58:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-04-09 20:58:31,657 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:31,657 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, 3, 3, 3, 3, 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] [2018-04-09 20:58:31,657 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:58:31,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1558902031, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:58:31,666 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:31,725 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 236 proven. 8 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-04-09 20:58:31,780 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 154 proven. 58 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-04-09 20:58:31,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:58:31,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-09 20:58:31,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 20:58:31,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 20:58:31,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-04-09 20:58:31,914 INFO L87 Difference]: Start difference. First operand 50015 states and 68117 transitions. Second operand 15 states. [2018-04-09 20:58:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:35,533 INFO L93 Difference]: Finished difference Result 106524 states and 145064 transitions. [2018-04-09 20:58:35,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-09 20:58:35,534 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 177 [2018-04-09 20:58:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:35,634 INFO L225 Difference]: With dead ends: 106524 [2018-04-09 20:58:35,634 INFO L226 Difference]: Without dead ends: 56565 [2018-04-09 20:58:35,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2018-04-09 20:58:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56565 states. [2018-04-09 20:58:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56565 to 56335. [2018-04-09 20:58:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56335 states. [2018-04-09 20:58:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56335 states to 56335 states and 76339 transitions. [2018-04-09 20:58:38,476 INFO L78 Accepts]: Start accepts. Automaton has 56335 states and 76339 transitions. Word has length 177 [2018-04-09 20:58:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:38,476 INFO L459 AbstractCegarLoop]: Abstraction has 56335 states and 76339 transitions. [2018-04-09 20:58:38,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 20:58:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 56335 states and 76339 transitions. [2018-04-09 20:58:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-04-09 20:58:38,479 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:38,479 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-09 20:58:38,479 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:58:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1599515383, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:58:38,488 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:38,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 150 proven. 114 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-04-09 20:58:38,670 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 152 proven. 112 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-04-09 20:58:38,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:58:38,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-04-09 20:58:38,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 20:58:38,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 20:58:38,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-04-09 20:58:38,814 INFO L87 Difference]: Start difference. First operand 56335 states and 76339 transitions. Second operand 15 states. [2018-04-09 20:58:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:43,499 INFO L93 Difference]: Finished difference Result 85505 states and 117559 transitions. [2018-04-09 20:58:43,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-09 20:58:43,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 181 [2018-04-09 20:58:43,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:43,643 INFO L225 Difference]: With dead ends: 85505 [2018-04-09 20:58:43,643 INFO L226 Difference]: Without dead ends: 85502 [2018-04-09 20:58:43,671 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 356 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2018-04-09 20:58:43,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85502 states. [2018-04-09 20:58:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85502 to 82786. [2018-04-09 20:58:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82786 states. [2018-04-09 20:58:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82786 states to 82786 states and 112825 transitions. [2018-04-09 20:58:47,776 INFO L78 Accepts]: Start accepts. Automaton has 82786 states and 112825 transitions. Word has length 181 [2018-04-09 20:58:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:58:47,776 INFO L459 AbstractCegarLoop]: Abstraction has 82786 states and 112825 transitions. [2018-04-09 20:58:47,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 20:58:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 82786 states and 112825 transitions. [2018-04-09 20:58:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-04-09 20:58:47,779 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:58:47,779 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-09 20:58:47,779 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:58:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1599515382, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:58:47,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:58:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:58:47,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:58:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 86 proven. 140 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-04-09 20:58:48,044 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:58:48,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-04-09 20:58:48,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 20:58:48,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 20:58:48,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-04-09 20:58:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 86 proven. 140 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-04-09 20:58:48,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:58:48,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-04-09 20:58:48,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 20:58:48,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 20:58:48,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-04-09 20:58:48,376 INFO L87 Difference]: Start difference. First operand 82786 states and 112825 transitions. Second operand 21 states. [2018-04-09 20:58:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:58:57,716 INFO L93 Difference]: Finished difference Result 144873 states and 199251 transitions. [2018-04-09 20:58:57,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-09 20:58:57,716 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 181 [2018-04-09 20:58:57,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:58:58,022 INFO L225 Difference]: With dead ends: 144873 [2018-04-09 20:58:58,022 INFO L226 Difference]: Without dead ends: 144870 [2018-04-09 20:58:58,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 360 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=829, Invalid=2831, Unknown=0, NotChecked=0, Total=3660 [2018-04-09 20:58:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144870 states. [2018-04-09 20:59:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144870 to 139328. [2018-04-09 20:59:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139328 states. [2018-04-09 20:59:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139328 states to 139328 states and 190294 transitions. [2018-04-09 20:59:05,274 INFO L78 Accepts]: Start accepts. Automaton has 139328 states and 190294 transitions. Word has length 181 [2018-04-09 20:59:05,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:59:05,274 INFO L459 AbstractCegarLoop]: Abstraction has 139328 states and 190294 transitions. [2018-04-09 20:59:05,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 20:59:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 139328 states and 190294 transitions. [2018-04-09 20:59:05,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-09 20:59:05,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:59:05,277 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 20:59:05,277 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:59:05,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1120286836, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:59:05,283 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:59:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:59:05,342 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:59:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 230 proven. 6 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-04-09 20:59:05,427 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:59:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 136 proven. 76 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-04-09 20:59:05,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:59:05,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-04-09 20:59:05,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 20:59:05,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 20:59:05,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-04-09 20:59:05,576 INFO L87 Difference]: Start difference. First operand 139328 states and 190294 transitions. Second operand 15 states. [2018-04-09 20:59:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:59:13,350 INFO L93 Difference]: Finished difference Result 251973 states and 342742 transitions. [2018-04-09 20:59:13,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 20:59:13,351 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 184 [2018-04-09 20:59:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:59:13,622 INFO L225 Difference]: With dead ends: 251973 [2018-04-09 20:59:13,622 INFO L226 Difference]: Without dead ends: 112701 [2018-04-09 20:59:13,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2018-04-09 20:59:13,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112701 states. [2018-04-09 20:59:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112701 to 96342. [2018-04-09 20:59:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96342 states. [2018-04-09 20:59:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96342 states to 96342 states and 130164 transitions. [2018-04-09 20:59:18,739 INFO L78 Accepts]: Start accepts. Automaton has 96342 states and 130164 transitions. Word has length 184 [2018-04-09 20:59:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:59:18,739 INFO L459 AbstractCegarLoop]: Abstraction has 96342 states and 130164 transitions. [2018-04-09 20:59:18,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 20:59:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 96342 states and 130164 transitions. [2018-04-09 20:59:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-04-09 20:59:18,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:59:18,742 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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-09 20:59:18,742 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:59:18,743 INFO L82 PathProgramCache]: Analyzing trace with hash 604535016, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:59:18,947 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:59:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:59:19,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:59:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 196 proven. 4 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2018-04-09 20:59:19,074 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:59:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 102 proven. 90 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-04-09 20:59:19,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:59:19,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-04-09 20:59:19,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 20:59:19,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 20:59:19,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-04-09 20:59:19,202 INFO L87 Difference]: Start difference. First operand 96342 states and 130164 transitions. Second operand 13 states. [2018-04-09 20:59:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:59:22,754 INFO L93 Difference]: Finished difference Result 152471 states and 201817 transitions. [2018-04-09 20:59:22,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-09 20:59:22,754 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2018-04-09 20:59:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:59:22,851 INFO L225 Difference]: With dead ends: 152471 [2018-04-09 20:59:22,852 INFO L226 Difference]: Without dead ends: 53944 [2018-04-09 20:59:22,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2018-04-09 20:59:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53944 states. [2018-04-09 20:59:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53944 to 53409. [2018-04-09 20:59:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53409 states. [2018-04-09 20:59:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53409 states to 53409 states and 67833 transitions. [2018-04-09 20:59:25,726 INFO L78 Accepts]: Start accepts. Automaton has 53409 states and 67833 transitions. Word has length 193 [2018-04-09 20:59:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:59:25,726 INFO L459 AbstractCegarLoop]: Abstraction has 53409 states and 67833 transitions. [2018-04-09 20:59:25,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 20:59:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 53409 states and 67833 transitions. [2018-04-09 20:59:25,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-09 20:59:25,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:59:25,733 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 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-09 20:59:25,733 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:59:25,733 INFO L82 PathProgramCache]: Analyzing trace with hash -290966208, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:59:25,739 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:59:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 20:59:25,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 20:59:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 218 proven. 7 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-04-09 20:59:25,943 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 20:59:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 196 proven. 21 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-04-09 20:59:26,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 20:59:26,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-04-09 20:59:26,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-09 20:59:26,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-09 20:59:26,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-09 20:59:26,113 INFO L87 Difference]: Start difference. First operand 53409 states and 67833 transitions. Second operand 16 states. [2018-04-09 20:59:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 20:59:29,023 INFO L93 Difference]: Finished difference Result 104407 states and 132386 transitions. [2018-04-09 20:59:29,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-09 20:59:29,023 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 249 [2018-04-09 20:59:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 20:59:29,108 INFO L225 Difference]: With dead ends: 104407 [2018-04-09 20:59:29,109 INFO L226 Difference]: Without dead ends: 48240 [2018-04-09 20:59:29,162 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 489 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=634, Unknown=0, NotChecked=0, Total=870 [2018-04-09 20:59:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48240 states. [2018-04-09 20:59:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48240 to 47584. [2018-04-09 20:59:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47584 states. [2018-04-09 20:59:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47584 states to 47584 states and 57159 transitions. [2018-04-09 20:59:31,739 INFO L78 Accepts]: Start accepts. Automaton has 47584 states and 57159 transitions. Word has length 249 [2018-04-09 20:59:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 20:59:31,740 INFO L459 AbstractCegarLoop]: Abstraction has 47584 states and 57159 transitions. [2018-04-09 20:59:31,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-09 20:59:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 47584 states and 57159 transitions. [2018-04-09 20:59:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-04-09 20:59:31,746 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 20:59:31,747 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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-09 20:59:31,747 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_flockfree_____false_valid_memtrack_i__pushErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr5RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr6RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__pushErr7RequiresViolation, mainErr1RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr2AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr3AssertViolationMEMORY_FREE, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr2RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr4RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr0RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr3RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr1RequiresViolation, __U_MULTI_flockfree_____false_valid_memtrack_i__popErr5RequiresViolation]=== [2018-04-09 20:59:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1301090973, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 20:59:31,753 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 20:59:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-09 20:59:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-09 20:59:32,119 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-09 20:59:32,244 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-09 20:59:32,264 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-09 20:59:32,265 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-09 20:59:32,266 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-09 20:59:32,268 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-09 20:59:32,268 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-09 20:59:32,269 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-09 20:59:32,275 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-09 20:59:32,276 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-09 20:59:32,277 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-09 20:59:32,277 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-09 20:59:32,278 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-09 20:59:32,283 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-09 20:59:32,283 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-09 20:59:32,284 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-09 20:59:32,285 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-09 20:59:32,286 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-09 20:59:32,286 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-09 20:59:32,287 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-09 20:59:32,290 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-09 20:59:32,291 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-09 20:59:32,291 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-09 20:59:32,291 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-09 20:59:32,292 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-09 20:59:32,292 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-09 20:59:32,292 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-09 20:59:32,293 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-09 20:59:32,293 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-09 20:59:32,295 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-09 20:59:32,296 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-09 20:59:32,296 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-09 20:59:32,296 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-09 20:59:32,297 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-09 20:59:32,297 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-09 20:59:32,297 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-09 20:59:32,298 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-09 20:59:32,298 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-09 20:59:32,298 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-09 20:59:32,299 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-09 20:59:32,299 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-09 20:59:32,301 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-09 20:59:32,301 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-09 20:59:32,302 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-09 20:59:32,302 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-09 20:59:32,302 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-09 20:59:32,302 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-09 20:59:32,303 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-09 20:59:32,303 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-09 20:59:32,303 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-09 20:59:32,304 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-09 20:59:32,304 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-09 20:59:32,305 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-09 20:59:32,305 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-09 20:59:32,307 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,308 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,308 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,310 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,310 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,311 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,311 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,311 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,313 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,314 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,314 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,314 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,314 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,315 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,315 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,315 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,317 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,317 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,318 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,318 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,318 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,319 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,319 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,319 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,319 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,320 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement [2018-04-09 20:59:32,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 08:59:32 BoogieIcfgContainer [2018-04-09 20:59:32,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 20:59:32,347 INFO L168 Benchmark]: Toolchain (without parser) took 109338.57 ms. Allocated memory was 303.0 MB in the beginning and 3.1 GB in the end (delta: 2.8 GB). Free memory was 240.1 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-04-09 20:59:32,348 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 303.0 MB. Free memory is still 264.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 20:59:32,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.71 ms. Allocated memory is still 303.0 MB. Free memory was 238.2 MB in the beginning and 212.2 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. [2018-04-09 20:59:32,349 INFO L168 Benchmark]: Boogie Preprocessor took 60.40 ms. Allocated memory is still 303.0 MB. Free memory was 212.2 MB in the beginning and 210.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:59:32,349 INFO L168 Benchmark]: RCFGBuilder took 654.84 ms. Allocated memory was 303.0 MB in the beginning and 460.8 MB in the end (delta: 157.8 MB). Free memory was 210.3 MB in the beginning and 385.1 MB in the end (delta: -174.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-04-09 20:59:32,349 INFO L168 Benchmark]: TraceAbstraction took 108281.97 ms. Allocated memory was 460.8 MB in the beginning and 3.1 GB in the end (delta: 2.6 GB). Free memory was 385.1 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 5.3 GB. [2018-04-09 20:59:32,351 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.25 ms. Allocated memory is still 303.0 MB. Free memory is still 264.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 336.71 ms. Allocated memory is still 303.0 MB. Free memory was 238.2 MB in the beginning and 212.2 MB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 60.40 ms. Allocated memory is still 303.0 MB. Free memory was 212.2 MB in the beginning and 210.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 654.84 ms. Allocated memory was 303.0 MB in the beginning and 460.8 MB in the end (delta: 157.8 MB). Free memory was 210.3 MB in the beginning and 385.1 MB in the end (delta: -174.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 108281.97 ms. Allocated memory was 460.8 MB in the beginning and 3.1 GB in the end (delta: 2.6 GB). Free memory was 385.1 MB in the beginning and 1.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression #t~switch4 has a C AST node but it is no IASTExpression: class org.eclipse.cdt.internal.core.dom.parser.c.CASTSwitchStatement * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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)=14, \old(t1)=18, \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)=15, \old(S)=13, \old(t1)=18, \old(t1)=14, \old(t4)=17, \old(t4)=21, \old(x1)=19, \old(x1)=9, \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)=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)=21, \old(t4)=17, \old(x1)=19, \old(x1)=9, \old(x4)=25, \old(x4)=23, 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)=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)=19, \old(x1)=9, \old(x4)=23, \old(x4)=25, 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)=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)=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)=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)=21, \old(t4)=17, \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={17:21}, x1={0:0}, x4={23:25}] [L658] static struct cell *t4 = ((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)=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={0:0}, x1={0:0}, x4={23:25}] [L659] static struct cell *x4 = ((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)=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={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)=17, \old(t4)=21, \old(x1)=19, \old(x1)=9, \old(x4)=23, \old(x4)=25, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=-1, garbage={0:0}, pc1=1, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] [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))={40: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))={40:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={40: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))={40:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={40: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))={40:0}, pc1=2, pc1++=1, pc4=1, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={40: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={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=2, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40: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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=0, \old(x1)=40, \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={40:0}, x4={0:0}] [L637] COND TRUE case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=2, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \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={40: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)=40, \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={40: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={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=3, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40: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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=4, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40: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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=5, pc4=1, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40: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={40: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)=40, \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={40: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)=40, \old(x1)=0, \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={40: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)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=40, \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={40: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)=0, \old(x1)=40, \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={40: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)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=5, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40: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={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=6, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L631] pc1++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=6, \old(pc4)=1, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=40, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=7, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=40, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc1++=6, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40: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={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L691] COND FALSE !(__VERIFIER_nondet_int()) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=40, \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={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=40, \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, pc4++=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L664] COND TRUE case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={40:0}, t1={0:0}, t4={0:0}, x1={40:0}, x4={0:0}] [L665] RET t4 = S VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=1, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L691] COND FALSE !(__VERIFIER_nondet_int()) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=2, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] COND TRUE case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L668] COND FALSE, RET !(t4 == ((void *)0)) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=2, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=2, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L691] COND FALSE !(__VERIFIER_nondet_int()) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=3, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] COND FALSE !(case 2:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L671] COND TRUE case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L672] EXPR, FCALL t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, t4->next={0:0}, x1={40:0}, x4={0:0}] [L672] RET x4 = t4->next VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=3, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=3, res4=0, S={40:0}, t1={0:0}, t4={40:0}, t4->next={0:0}, x1={40:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND TRUE S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=1, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L691] COND FALSE !(__VERIFIER_nondet_int()) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] CALL pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=4, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L663] pc4++ VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] case 1: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L664] COND FALSE !(case 1:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] case 2: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L667] COND FALSE !(case 2:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=0, \old(S)=40, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L671] case 3: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L671] COND FALSE !(case 3:) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L674] case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L674] COND TRUE case 4: VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=40, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L675] COND TRUE S == t4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={40:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L676] RET S = x4 VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=4, \old(res4)=0, \old(S)=40, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=40, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, pc4++=4, res4=0, S={0:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L694] pop() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] S || 1 != pc1 || __VERIFIER_nondet_int() VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={40:0}, x1={40:0}, x4={0:0}] [L690] COND FALSE !(S || 1 != pc1 || __VERIFIER_nondet_int()) VAL [\old(garbage)=0, \old(garbage)=0, \old(pc1)=1, \old(pc4)=1, \old(res4)=0, \old(S)=0, \old(S)=0, \old(t1)=0, \old(t1)=0, \old(t4)=0, \old(t4)=0, \old(x1)=0, \old(x1)=0, \old(x4)=0, \old(x4)=0, __VERIFIER_nondet_int()=0, garbage={0:0}, pc1=1, pc4=5, res4=0, S={0:0}, S || 1 != pc1 || __VERIFIER_nondet_int()=0, t1={0:0}, t4={40:0}, x1={40: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=5, res4=0, S={0:0}, t1={0:0}, t4={40:0}, x1={40: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=5, res4=0, S={0:0}, t1={0:0}, t4={40:0}, x1={40: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=5, res4=0, S={0:0}, t1={0:0}, t4={40:0}, x1={40: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=5, res4=0, S={0:0}, t1={0:0}, t4={40: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=5, 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=5, 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=5, res4=0, S={0:0}, t1={0:0}, t4={0:0}, x1={0:0}, x4={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 129 locations, 19 error locations. UNSAFE Result, 108.2s OverallTime, 32 OverallIterations, 11 TraceHistogramMax, 58.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5501 SDtfs, 17786 SDslu, 15581 SDs, 0 SdLazy, 15293 SolverSat, 2597 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6613 GetRequests, 5933 SyntacticMatches, 21 SemanticMatches, 659 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4141 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139328occurred in iteration=28, 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: 38.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 71430 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 3341 NumberOfCodeBlocks, 3341 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 6114 ConstructedInterpolants, 32 QuantifiedInterpolants, 2691088 SizeOfPredicates, 196 NumberOfNonLiveVariables, 13575 ConjunctsInSsa, 443 ConjunctsInUnsatCore, 62 InterpolantComputations, 23 PerfectInterpolantSequences, 6654/8024 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.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_20-59-32-364.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lockfree-3.3_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_20-59-32-364.csv Received shutdown request...