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-ext2/length_test03_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 20:39:47,004 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 20:39:47,005 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 20:39:47,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 20:39:47,020 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 20:39:47,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 20:39:47,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 20:39:47,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 20:39:47,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 20:39:47,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 20:39:47,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 20:39:47,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 20:39:47,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 20:39:47,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 20:39:47,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 20:39:47,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 20:39:47,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 20:39:47,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 20:39:47,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 20:39:47,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 20:39:47,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 20:39:47,042 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 20:39:47,043 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 20:39:47,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 20:39:47,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 20:39:47,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 20:39:47,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 20:39:47,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 20:39:47,048 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 20:39:47,048 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 20:39:47,049 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 20:39:47,049 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-06 20:39:47,073 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 20:39:47,073 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 20:39:47,074 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 20:39:47,074 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 20:39:47,075 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 20:39:47,075 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 20:39:47,075 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 20:39:47,075 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 20:39:47,075 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 20:39:47,076 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 20:39:47,076 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 20:39:47,076 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 20:39:47,076 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 20:39:47,077 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 20:39:47,077 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 20:39:47,077 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 20:39:47,077 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 20:39:47,077 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 20:39:47,078 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 20:39:47,078 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 20:39:47,078 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 20:39:47,078 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 20:39:47,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 20:39:47,079 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 20:39:47,079 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 20:39:47,079 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 20:39:47,079 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 20:39:47,080 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 20:39:47,080 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 20:39:47,080 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 20:39:47,080 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 20:39:47,080 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 20:39:47,080 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:47,081 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 20:39:47,081 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 20:39:47,082 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 20:39:47,082 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 20:39:47,082 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 20:39:47,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 20:39:47,129 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 20:39:47,134 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 20:39:47,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 20:39:47,136 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 20:39:47,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,457 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3dcad8d53 [2018-04-06 20:39:47,630 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 20:39:47,630 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 20:39:47,631 INFO L168 CDTParser]: Scanning length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,642 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 20:39:47,642 INFO L215 ultiparseSymbolTable]: [2018-04-06 20:39:47,643 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 20:39:47,643 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 ('__bswap_32') in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,643 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 ('__bswap_64') in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,643 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_flength_test___false_valid_memtrack_i__append ('append') in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,643 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,643 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 20:39:47,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__gid_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,643 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__off_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blkcnt64_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ldiv_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____nlink_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_short in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int8_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int64_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____mode_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,644 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____timer_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uid_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ssize_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____sig_atomic_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__key_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ssize_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__nlink_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsfilcnt_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,645 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__timer_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__mode_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsword_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_short in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int32_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint64_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pid_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____clockid_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int8_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____suseconds_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,646 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__clockid_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____pthread_slist_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__quad_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__caddr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fd_mask in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____id_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int16_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____syscall_ulong_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_cond_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int32_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint32_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,647 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__div_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__blksize_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_spinlock_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsblkcnt_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__size_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____pid_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_once_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_quad_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____intptr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_mutexattr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_char in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____off64_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,648 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____quad_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsblkcnt64_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____socklen_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__lldiv_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__uid_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int16_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_barrier_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_attr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__wchar_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____rlim_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int16_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_rwlockattr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_char in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__daddr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__blkcnt_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__sigset_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,649 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint16_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_long in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____gid_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ino_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____loff_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____ino64_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____sigset_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_int32_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsid_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____dev_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ulong in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_long in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__suseconds_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fd_mask in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,650 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__clock_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____caddr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____off_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fd_set in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__dev_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____rlim64_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____key_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__loff_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__uint in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____uint8_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__time_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_rwlock_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____u_int in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__fsid_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____qaddr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,651 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blkcnt_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____clock_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____daddr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__id_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int64_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____blksize_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_condattr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ushort in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____syscall_slong_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__u_quad_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsfilcnt_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____time_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,652 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__int8_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_key_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsblkcnt_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__register_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____int64_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_barrierattr_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____fsfilcnt64_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__pthread_mutex_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i__ino_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_flength_test___false_valid_memtrack_i____useconds_t in length_test03_false-valid-memtrack.i [2018-04-06 20:39:47,674 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3dcad8d53 [2018-04-06 20:39:47,679 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 20:39:47,680 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 20:39:47,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 20:39:47,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 20:39:47,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 20:39:47,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 08:39:47" (1/1) ... [2018-04-06 20:39:47,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44b11b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:47, skipping insertion in model container [2018-04-06 20:39:47,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 08:39:47" (1/1) ... [2018-04-06 20:39:47,702 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 20:39:47,735 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 20:39:47,912 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 20:39:47,968 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 20:39:47,976 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 119 non ball SCCs. Number of states in SCCs 119. [2018-04-06 20:39:48,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:48 WrapperNode [2018-04-06 20:39:48,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 20:39:48,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 20:39:48,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 20:39:48,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 20:39:48,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:48" (1/1) ... [2018-04-06 20:39:48,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:48" (1/1) ... [2018-04-06 20:39:48,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:48" (1/1) ... [2018-04-06 20:39:48,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:48" (1/1) ... [2018-04-06 20:39:48,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:48" (1/1) ... [2018-04-06 20:39:48,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:48" (1/1) ... [2018-04-06 20:39:48,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:48" (1/1) ... [2018-04-06 20:39:48,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 20:39:48,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 20:39:48,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 20:39:48,082 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 20:39:48,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:48" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 20:39:48,198 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 20:39:48,198 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 20:39:48,198 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-06 20:39:48,199 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-06 20:39:48,199 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-06 20:39:48,199 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 20:39:48,199 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-06 20:39:48,199 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 20:39:48,199 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 20:39:48,199 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 20:39:48,199 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 20:39:48,200 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 20:39:48,200 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 20:39:48,200 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 20:39:48,200 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 20:39:48,200 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 20:39:48,200 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 20:39:48,200 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 20:39:48,200 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 20:39:48,200 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 20:39:48,200 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_32 [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i____bswap_64 [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 20:39:48,201 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 20:39:48,202 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 20:39:48,203 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 20:39:48,204 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 20:39:48,205 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 20:39:48,206 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 20:39:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 20:39:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 20:39:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 20:39:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 20:39:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 20:39:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 20:39:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 20:39:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 20:39:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 20:39:48,207 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 20:39:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 20:39:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 20:39:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 20:39:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 20:39:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-04-06 20:39:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 20:39:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_flength_test___false_valid_memtrack_i__append [2018-04-06 20:39:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 20:39:48,208 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 20:39:48,209 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-06 20:39:48,209 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-06 20:39:48,209 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 20:39:48,209 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 20:39:48,209 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 20:39:48,209 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 20:39:48,209 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 20:39:48,209 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 20:39:48,770 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 20:39:48,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:39:48 BoogieIcfgContainer [2018-04-06 20:39:48,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 20:39:48,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 20:39:48,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 20:39:48,776 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 20:39:48,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 08:39:47" (1/3) ... [2018-04-06 20:39:48,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e081b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 08:39:48, skipping insertion in model container [2018-04-06 20:39:48,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 08:39:48" (2/3) ... [2018-04-06 20:39:48,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e081b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 08:39:48, skipping insertion in model container [2018-04-06 20:39:48,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 08:39:48" (3/3) ... [2018-04-06 20:39:48,781 INFO L107 eAbstractionObserver]: Analyzing ICFG length_test03_false-valid-memtrack.i [2018-04-06 20:39:48,791 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 20:39:48,799 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-04-06 20:39:48,852 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 20:39:48,852 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 20:39:48,852 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 20:39:48,853 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 20:39:48,853 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 20:39:48,853 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 20:39:48,853 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 20:39:48,853 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 20:39:48,853 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 20:39:48,854 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 20:39:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2018-04-06 20:39:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-06 20:39:48,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:48,874 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:39:48,874 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash -203092121, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:48,889 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:48,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:48,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:39:48,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:48,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:48,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:39:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:48,985 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:49,014 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:49,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:39:49,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 20:39:49,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 20:39:49,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:39:49,028 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2018-04-06 20:39:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:49,495 INFO L93 Difference]: Finished difference Result 354 states and 377 transitions. [2018-04-06 20:39:49,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 20:39:49,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-06 20:39:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:49,510 INFO L225 Difference]: With dead ends: 354 [2018-04-06 20:39:49,510 INFO L226 Difference]: Without dead ends: 212 [2018-04-06 20:39:49,514 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 20:39:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-06 20:39:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 164. [2018-04-06 20:39:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-06 20:39:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 170 transitions. [2018-04-06 20:39:49,563 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 170 transitions. Word has length 9 [2018-04-06 20:39:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:49,564 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 170 transitions. [2018-04-06 20:39:49,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 20:39:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 170 transitions. [2018-04-06 20:39:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-06 20:39:49,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:49,565 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:39:49,565 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:49,565 INFO L82 PathProgramCache]: Analyzing trace with hash -203092120, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:49,572 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:49,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:49,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:39:49,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:49,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:49,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 20:39:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:49,613 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:49,670 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:49,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 20:39:49,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 20:39:49,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 20:39:49,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 20:39:49,672 INFO L87 Difference]: Start difference. First operand 164 states and 170 transitions. Second operand 6 states. [2018-04-06 20:39:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:49,911 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2018-04-06 20:39:49,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 20:39:49,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-06 20:39:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:49,913 INFO L225 Difference]: With dead ends: 169 [2018-04-06 20:39:49,914 INFO L226 Difference]: Without dead ends: 167 [2018-04-06 20:39:49,914 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 20:39:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-06 20:39:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 162. [2018-04-06 20:39:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-06 20:39:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 168 transitions. [2018-04-06 20:39:49,927 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 168 transitions. Word has length 9 [2018-04-06 20:39:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:49,928 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 168 transitions. [2018-04-06 20:39:49,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 20:39:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2018-04-06 20:39:49,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-06 20:39:49,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:49,929 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:39:49,929 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1384557355, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:49,938 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:49,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:49,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:39:49,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:49,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:49,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:39:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:50,028 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:50,054 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:50,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:39:50,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 20:39:50,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 20:39:50,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:39:50,055 INFO L87 Difference]: Start difference. First operand 162 states and 168 transitions. Second operand 4 states. [2018-04-06 20:39:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:50,184 INFO L93 Difference]: Finished difference Result 187 states and 195 transitions. [2018-04-06 20:39:50,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 20:39:50,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-06 20:39:50,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:50,185 INFO L225 Difference]: With dead ends: 187 [2018-04-06 20:39:50,185 INFO L226 Difference]: Without dead ends: 184 [2018-04-06 20:39:50,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 20:39:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-06 20:39:50,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 167. [2018-04-06 20:39:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-06 20:39:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 175 transitions. [2018-04-06 20:39:50,197 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 175 transitions. Word has length 13 [2018-04-06 20:39:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:50,198 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 175 transitions. [2018-04-06 20:39:50,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 20:39:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 175 transitions. [2018-04-06 20:39:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-06 20:39:50,198 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:50,199 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:39:50,199 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:50,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1384557356, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:50,211 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:50,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:50,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:39:50,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:50,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:50,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 20:39:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:50,299 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:50,363 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:50,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 20:39:50,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 20:39:50,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 20:39:50,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 20:39:50,364 INFO L87 Difference]: Start difference. First operand 167 states and 175 transitions. Second operand 6 states. [2018-04-06 20:39:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:50,510 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2018-04-06 20:39:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 20:39:50,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-06 20:39:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:50,511 INFO L225 Difference]: With dead ends: 172 [2018-04-06 20:39:50,511 INFO L226 Difference]: Without dead ends: 170 [2018-04-06 20:39:50,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 20:39:50,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-06 20:39:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2018-04-06 20:39:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-06 20:39:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 173 transitions. [2018-04-06 20:39:50,523 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 173 transitions. Word has length 13 [2018-04-06 20:39:50,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:50,523 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 173 transitions. [2018-04-06 20:39:50,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 20:39:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 173 transitions. [2018-04-06 20:39:50,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-06 20:39:50,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:50,525 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] [2018-04-06 20:39:50,525 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:50,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1217890101, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:50,540 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:50,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:50,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:39:50,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:50,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:50,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:39:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:50,585 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:50,617 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:50,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 20:39:50,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 20:39:50,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 20:39:50,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:39:50,618 INFO L87 Difference]: Start difference. First operand 165 states and 173 transitions. Second operand 4 states. [2018-04-06 20:39:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:50,713 INFO L93 Difference]: Finished difference Result 165 states and 173 transitions. [2018-04-06 20:39:50,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 20:39:50,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-06 20:39:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:50,714 INFO L225 Difference]: With dead ends: 165 [2018-04-06 20:39:50,714 INFO L226 Difference]: Without dead ends: 160 [2018-04-06 20:39:50,715 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 20:39:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-06 20:39:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-04-06 20:39:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-06 20:39:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2018-04-06 20:39:50,722 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 25 [2018-04-06 20:39:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:50,723 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2018-04-06 20:39:50,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 20:39:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2018-04-06 20:39:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-06 20:39:50,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:50,724 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] [2018-04-06 20:39:50,724 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:50,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1217890102, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:50,736 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:50,757 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:50,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:39:50,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:50,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:50,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 20:39:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:50,775 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:50,818 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:50,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-06 20:39:50,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 20:39:50,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 20:39:50,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 20:39:50,819 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand 6 states. [2018-04-06 20:39:50,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:50,907 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2018-04-06 20:39:50,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 20:39:50,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-06 20:39:50,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:50,909 INFO L225 Difference]: With dead ends: 160 [2018-04-06 20:39:50,909 INFO L226 Difference]: Without dead ends: 155 [2018-04-06 20:39:50,910 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-06 20:39:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-06 20:39:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-04-06 20:39:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-06 20:39:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2018-04-06 20:39:50,916 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 25 [2018-04-06 20:39:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:50,916 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2018-04-06 20:39:50,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 20:39:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2018-04-06 20:39:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-06 20:39:50,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:50,917 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:39:50,917 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:50,918 INFO L82 PathProgramCache]: Analyzing trace with hash -900112552, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:50,924 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:50,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:50,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-04-06 20:39:50,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:50,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:50,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-06 20:39:50,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-04-06 20:39:50,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:50,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:50,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-06 20:39:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:51,014 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:51,081 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:51,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 12 [2018-04-06 20:39:51,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-06 20:39:51,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-06 20:39:51,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-04-06 20:39:51,082 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 13 states. [2018-04-06 20:39:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:51,361 INFO L93 Difference]: Finished difference Result 252 states and 272 transitions. [2018-04-06 20:39:51,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-06 20:39:51,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-04-06 20:39:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:51,363 INFO L225 Difference]: With dead ends: 252 [2018-04-06 20:39:51,364 INFO L226 Difference]: Without dead ends: 244 [2018-04-06 20:39:51,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2018-04-06 20:39:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-06 20:39:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 183. [2018-04-06 20:39:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-06 20:39:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 203 transitions. [2018-04-06 20:39:51,373 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 203 transitions. Word has length 26 [2018-04-06 20:39:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:51,373 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 203 transitions. [2018-04-06 20:39:51,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-06 20:39:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 203 transitions. [2018-04-06 20:39:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-06 20:39:51,374 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:51,374 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:39:51,374 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash -900112551, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:51,380 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:51,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:51,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 20:39:51,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:51,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:51,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 20:39:51,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 14 [2018-04-06 20:39:51,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:51,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-04-06 20:39:51,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:51,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:51,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:27 [2018-04-06 20:39:51,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:51,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:51,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-04-06 20:39:51,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:51,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:51,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:51,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 20:39:51,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:51,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:51,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-04-06 20:39:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:51,576 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:51,909 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:39:51,910 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:39:51,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-04-06 20:39:51,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:51,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 20:39:51,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:19 [2018-04-06 20:39:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:51,998 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:51,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2018-04-06 20:39:51,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-06 20:39:51,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-06 20:39:51,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-04-06 20:39:51,999 INFO L87 Difference]: Start difference. First operand 183 states and 203 transitions. Second operand 20 states. [2018-04-06 20:39:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:52,846 INFO L93 Difference]: Finished difference Result 415 states and 439 transitions. [2018-04-06 20:39:52,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-06 20:39:52,846 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-04-06 20:39:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:52,848 INFO L225 Difference]: With dead ends: 415 [2018-04-06 20:39:52,849 INFO L226 Difference]: Without dead ends: 412 [2018-04-06 20:39:52,850 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2018-04-06 20:39:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-04-06 20:39:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 182. [2018-04-06 20:39:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-06 20:39:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 199 transitions. [2018-04-06 20:39:52,858 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 199 transitions. Word has length 26 [2018-04-06 20:39:52,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:52,858 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 199 transitions. [2018-04-06 20:39:52,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-06 20:39:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 199 transitions. [2018-04-06 20:39:52,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-06 20:39:52,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:52,859 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] [2018-04-06 20:39:52,859 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:52,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1772223494, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:52,866 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:52,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:52,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:52,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-06 20:39:52,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:52,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:52,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:52,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 20:39:52,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:52,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:52,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2018-04-06 20:39:52,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:52,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:52,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:52,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36 [2018-04-06 20:39:52,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:53,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:53,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:53,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-06 20:39:53,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 20:39:53,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:26 [2018-04-06 20:39:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:53,063 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:53,239 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:39:53,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2018-04-06 20:39:53,265 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 20:39:53,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,272 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:39:53,272 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:39:53,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-04-06 20:39:53,273 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:39:53,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-06 20:39:53,284 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:33 [2018-04-06 20:39:53,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:53,325 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:53,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2018-04-06 20:39:53,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-06 20:39:53,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-06 20:39:53,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-04-06 20:39:53,326 INFO L87 Difference]: Start difference. First operand 182 states and 199 transitions. Second operand 17 states. [2018-04-06 20:39:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:53,838 INFO L93 Difference]: Finished difference Result 297 states and 318 transitions. [2018-04-06 20:39:53,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 20:39:53,839 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-04-06 20:39:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:53,841 INFO L225 Difference]: With dead ends: 297 [2018-04-06 20:39:53,841 INFO L226 Difference]: Without dead ends: 292 [2018-04-06 20:39:53,842 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-04-06 20:39:53,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-06 20:39:53,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 190. [2018-04-06 20:39:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-06 20:39:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 203 transitions. [2018-04-06 20:39:53,854 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 203 transitions. Word has length 29 [2018-04-06 20:39:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:53,855 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 203 transitions. [2018-04-06 20:39:53,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-06 20:39:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 203 transitions. [2018-04-06 20:39:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-06 20:39:53,856 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:53,856 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, 1, 1] [2018-04-06 20:39:53,856 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:53,856 INFO L82 PathProgramCache]: Analyzing trace with hash 572985994, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:53,862 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:53,888 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:53,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-04-06 20:39:53,907 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 8 treesize of output 7 [2018-04-06 20:39:53,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-04-06 20:39:53,918 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 8 treesize of output 7 [2018-04-06 20:39:53,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-06 20:39:53,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 16 [2018-04-06 20:39:53,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:53,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:39:53,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 16 [2018-04-06 20:39:53,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:53,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:39:53,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-06 20:39:53,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:53,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:53,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 20:39:53,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:53,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-04-06 20:39:54,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-06 20:39:54,009 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 8 treesize of output 7 [2018-04-06 20:39:54,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-06 20:39:54,027 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 8 treesize of output 7 [2018-04-06 20:39:54,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-06 20:39:54,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-06 20:39:54,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:54,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:39:54,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-06 20:39:54,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:54,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:39:54,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 20:39:54,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:69 [2018-04-06 20:39:54,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-04-06 20:39:54,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:54,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-06 20:39:54,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:54,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-06 20:39:54,285 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-04-06 20:39:54,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:54,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-06 20:39:54,301 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:54,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-06 20:39:54,310 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,314 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:54,330 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:83, output treesize:7 [2018-04-06 20:39:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:54,378 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:54,582 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:54,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 9] imperfect sequences [] total 17 [2018-04-06 20:39:54,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-06 20:39:54,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-06 20:39:54,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-04-06 20:39:54,583 INFO L87 Difference]: Start difference. First operand 190 states and 203 transitions. Second operand 17 states. [2018-04-06 20:39:54,812 WARN L148 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-06 20:39:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:55,192 INFO L93 Difference]: Finished difference Result 390 states and 420 transitions. [2018-04-06 20:39:55,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-06 20:39:55,192 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-04-06 20:39:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:55,193 INFO L225 Difference]: With dead ends: 390 [2018-04-06 20:39:55,193 INFO L226 Difference]: Without dead ends: 215 [2018-04-06 20:39:55,195 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=467, Unknown=1, NotChecked=0, Total=600 [2018-04-06 20:39:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-06 20:39:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 203. [2018-04-06 20:39:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-06 20:39:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 217 transitions. [2018-04-06 20:39:55,208 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 217 transitions. Word has length 38 [2018-04-06 20:39:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:55,208 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 217 transitions. [2018-04-06 20:39:55,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-06 20:39:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 217 transitions. [2018-04-06 20:39:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-06 20:39:55,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:55,209 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, 1, 1, 1, 1] [2018-04-06 20:39:55,210 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:55,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1111040505, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:55,222 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:55,247 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:55,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-04-06 20:39:55,288 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 10 treesize of output 9 [2018-04-06 20:39:55,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-04-06 20:39:55,298 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 10 treesize of output 9 [2018-04-06 20:39:55,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-06 20:39:55,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:55,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:55,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 20:39:55,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-06 20:39:55,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-06 20:39:55,370 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 8 treesize of output 7 [2018-04-06 20:39:55,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-06 20:39:55,386 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 8 treesize of output 7 [2018-04-06 20:39:55,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-06 20:39:55,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-06 20:39:55,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:55,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:39:55,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-04-06 20:39:55,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:55,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-06 20:39:55,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 20:39:55,460 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:58 [2018-04-06 20:39:55,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-06 20:39:55,619 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:39:55,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-06 20:39:55,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:55,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-06 20:39:55,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-06 20:39:55,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:39:55,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-06 20:39:55,646 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,651 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:39:55,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-06 20:39:55,652 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,661 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:82, output treesize:7 [2018-04-06 20:39:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:55,690 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:55,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 25 [2018-04-06 20:39:55,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-06 20:39:55,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:55,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:56,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 25 [2018-04-06 20:39:56,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-06 20:39:56,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:56,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:56,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-06 20:39:56,043 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:55, output treesize:27 [2018-04-06 20:39:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:56,133 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:56,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 13] imperfect sequences [] total 22 [2018-04-06 20:39:56,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-06 20:39:56,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-06 20:39:56,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=380, Unknown=3, NotChecked=0, Total=462 [2018-04-06 20:39:56,134 INFO L87 Difference]: Start difference. First operand 203 states and 217 transitions. Second operand 22 states. [2018-04-06 20:39:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:57,053 INFO L93 Difference]: Finished difference Result 428 states and 459 transitions. [2018-04-06 20:39:57,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-06 20:39:57,053 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-04-06 20:39:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:57,055 INFO L225 Difference]: With dead ends: 428 [2018-04-06 20:39:57,055 INFO L226 Difference]: Without dead ends: 253 [2018-04-06 20:39:57,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=1010, Unknown=3, NotChecked=0, Total=1260 [2018-04-06 20:39:57,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-06 20:39:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 206. [2018-04-06 20:39:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-06 20:39:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 220 transitions. [2018-04-06 20:39:57,066 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 220 transitions. Word has length 40 [2018-04-06 20:39:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:57,067 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 220 transitions. [2018-04-06 20:39:57,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-06 20:39:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 220 transitions. [2018-04-06 20:39:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-06 20:39:57,068 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:57,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:39:57,068 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2010604953, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:57,074 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:57,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:57,111 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:57,142 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 20:39:57,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-06 20:39:57,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 20:39:57,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 20:39:57,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:39:57,143 INFO L87 Difference]: Start difference. First operand 206 states and 220 transitions. Second operand 4 states. [2018-04-06 20:39:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:57,172 INFO L93 Difference]: Finished difference Result 290 states and 307 transitions. [2018-04-06 20:39:57,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 20:39:57,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-04-06 20:39:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:57,174 INFO L225 Difference]: With dead ends: 290 [2018-04-06 20:39:57,174 INFO L226 Difference]: Without dead ends: 219 [2018-04-06 20:39:57,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-06 20:39:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-06 20:39:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2018-04-06 20:39:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-06 20:39:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 211 transitions. [2018-04-06 20:39:57,184 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 211 transitions. Word has length 51 [2018-04-06 20:39:57,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:57,184 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 211 transitions. [2018-04-06 20:39:57,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 20:39:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 211 transitions. [2018-04-06 20:39:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-06 20:39:57,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:57,185 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, 1, 1, 1] [2018-04-06 20:39:57,185 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:57,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1142640021, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:57,192 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:57,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:57,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-04-06 20:39:57,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:57,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 20:39:57,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-04-06 20:39:57,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-04-06 20:39:57,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:39:57,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:39:57,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-06 20:39:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:57,314 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:39:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:39:57,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:39:57,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2018-04-06 20:39:57,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-06 20:39:57,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-06 20:39:57,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=182, Unknown=5, NotChecked=0, Total=240 [2018-04-06 20:39:57,477 INFO L87 Difference]: Start difference. First operand 200 states and 211 transitions. Second operand 16 states. [2018-04-06 20:39:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:39:58,086 INFO L93 Difference]: Finished difference Result 247 states and 257 transitions. [2018-04-06 20:39:58,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-06 20:39:58,086 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2018-04-06 20:39:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:39:58,088 INFO L225 Difference]: With dead ends: 247 [2018-04-06 20:39:58,088 INFO L226 Difference]: Without dead ends: 245 [2018-04-06 20:39:58,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=407, Unknown=6, NotChecked=0, Total=552 [2018-04-06 20:39:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-06 20:39:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 202. [2018-04-06 20:39:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-06 20:39:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 215 transitions. [2018-04-06 20:39:58,104 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 215 transitions. Word has length 57 [2018-04-06 20:39:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:39:58,104 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 215 transitions. [2018-04-06 20:39:58,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-06 20:39:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 215 transitions. [2018-04-06 20:39:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-06 20:39:58,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:39:58,106 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, 1, 1, 1] [2018-04-06 20:39:58,106 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:39:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1142640022, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:39:58,119 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:39:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:39:58,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:39:58,188 WARN L1033 $PredicateComparison]: unable to prove that (exists ((__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base Int)) (= |c_#length| (store |c_old(#length)| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base 9))) is different from true [2018-04-06 20:39:58,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 20 [2018-04-06 20:39:58,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-06 20:39:58,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 20:39:58,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:19 [2018-04-06 20:39:58,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 33 [2018-04-06 20:39:58,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-06 20:39:58,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-06 20:39:58,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:47 [2018-04-06 20:39:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-06 20:39:58,419 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:40:07,282 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:07,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 37 [2018-04-06 20:40:07,333 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:07,333 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:07,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-06 20:40:07,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:07,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-06 20:40:07,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:07,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:40:07,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:40:07,356 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-04-06 20:40:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:40:07,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:40:07,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2018-04-06 20:40:07,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-06 20:40:07,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-06 20:40:07,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=279, Unknown=9, NotChecked=34, Total=380 [2018-04-06 20:40:07,416 INFO L87 Difference]: Start difference. First operand 202 states and 215 transitions. Second operand 20 states. [2018-04-06 20:40:09,844 WARN L1011 $PredicateComparison]: unable to prove that (and (<= 0 |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.offset|) (<= (+ |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.offset| 4) (select |c_#length| |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.base|)) (exists ((__U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base Int)) (= (select |c_#length| __U_MULTI_flength_test___false_valid_memtrack_i__append_~node~0.base) 9)) (<= |c___U_MULTI_flength_test___false_valid_memtrack_i__append_#in~head.offset| 0) (forall ((v_main_~list2~0.offset_BEFORE_CALL_3 Int) (v_main_~list2~0.base_BEFORE_CALL_6 Int)) (or (exists ((|v___U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base_18| Int) (|v___U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base_21| Int)) (< (select (store (store |c_old(#length)| |v___U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base_21| 9) |v___U_MULTI_flength_test___false_valid_memtrack_i__append_#t~malloc2.base_18| 9) v_main_~list2~0.base_BEFORE_CALL_6) (+ v_main_~list2~0.offset_BEFORE_CALL_3 4))) (forall ((v_prenex_11 Int)) (<= (+ v_main_~list2~0.offset_BEFORE_CALL_3 4) (select (store |c_#length| v_prenex_11 9) v_main_~list2~0.base_BEFORE_CALL_6))) (< v_main_~list2~0.offset_BEFORE_CALL_3 0))) (= |c_old(#length)| |c_#length|)) is different from false [2018-04-06 20:40:12,238 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 36 DAG size of output 18 [2018-04-06 20:40:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:40:12,519 INFO L93 Difference]: Finished difference Result 204 states and 215 transitions. [2018-04-06 20:40:12,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 20:40:12,556 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2018-04-06 20:40:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:40:12,557 INFO L225 Difference]: With dead ends: 204 [2018-04-06 20:40:12,557 INFO L226 Difference]: Without dead ends: 202 [2018-04-06 20:40:12,558 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=109, Invalid=488, Unknown=11, NotChecked=94, Total=702 [2018-04-06 20:40:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-06 20:40:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-04-06 20:40:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-06 20:40:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 213 transitions. [2018-04-06 20:40:12,568 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 213 transitions. Word has length 57 [2018-04-06 20:40:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:40:12,568 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 213 transitions. [2018-04-06 20:40:12,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-06 20:40:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 213 transitions. [2018-04-06 20:40:12,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-06 20:40:12,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:40:12,569 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:40:12,569 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:40:12,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1521938275, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:40:12,575 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:40:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:40:12,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:40:12,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:12,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-06 20:40:12,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:12,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:12,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:12,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 20:40:12,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:12,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 20:40:12,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:27 [2018-04-06 20:40:12,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:12,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:12,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 30 [2018-04-06 20:40:12,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:12,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:12,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:12,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:12,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-06 20:40:12,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:12,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 20:40:12,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:30 [2018-04-06 20:40:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:40:13,062 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:40:13,845 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:13,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 34 [2018-04-06 20:40:13,881 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 20:40:13,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:13,887 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:13,888 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:13,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-04-06 20:40:13,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:13,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:40:13,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-06 20:40:13,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:33 [2018-04-06 20:40:13,926 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:13,926 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-04-06 20:40:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:40:13,963 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 20:40:13,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-04-06 20:40:13,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-06 20:40:13,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-06 20:40:13,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=391, Unknown=2, NotChecked=0, Total=462 [2018-04-06 20:40:13,964 INFO L87 Difference]: Start difference. First operand 200 states and 213 transitions. Second operand 22 states. [2018-04-06 20:40:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 20:40:15,689 INFO L93 Difference]: Finished difference Result 253 states and 264 transitions. [2018-04-06 20:40:15,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 20:40:15,690 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 60 [2018-04-06 20:40:15,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 20:40:15,692 INFO L225 Difference]: With dead ends: 253 [2018-04-06 20:40:15,692 INFO L226 Difference]: Without dead ends: 250 [2018-04-06 20:40:15,692 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=576, Unknown=2, NotChecked=0, Total=702 [2018-04-06 20:40:15,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-06 20:40:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 187. [2018-04-06 20:40:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-06 20:40:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 199 transitions. [2018-04-06 20:40:15,708 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 199 transitions. Word has length 60 [2018-04-06 20:40:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 20:40:15,708 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 199 transitions. [2018-04-06 20:40:15,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-06 20:40:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 199 transitions. [2018-04-06 20:40:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-06 20:40:15,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 20:40:15,709 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 20:40:15,709 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr14AssertViolationMEMORY_FREE, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr28EnsuresViolationMEMORY_LEAK, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr15AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr2RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr18RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr23RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr21RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr13RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr24RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr4RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr10RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr20RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr3RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr11RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr7RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr0RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr14RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr22RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr12RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr17RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr25RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr1RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr6RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr8RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr19RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr15RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr9RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr5RequiresViolation, __U_MULTI_flength_test___false_valid_memtrack_i__appendErr16RequiresViolation]=== [2018-04-06 20:40:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1568270471, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 20:40:15,719 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 20:40:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 20:40:15,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 20:40:15,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-04-06 20:40:15,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:15,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:40:15,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-06 20:40:15,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 13 treesize of output 10 [2018-04-06 20:40:15,976 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 10 treesize of output 9 [2018-04-06 20:40:15,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:15,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:40:15,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:40:15,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-06 20:40:16,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-06 20:40:16,036 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 24 treesize of output 23 [2018-04-06 20:40:16,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-04-06 20:40:16,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-06 20:40:16,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:40:16,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:40:16,095 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-04-06 20:40:16,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 33 treesize of output 28 [2018-04-06 20:40:16,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:16,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-06 20:40:16,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2018-04-06 20:40:16,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:16,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 54 [2018-04-06 20:40:16,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-06 20:40:16,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:16,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 66 [2018-04-06 20:40:16,253 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:40:16,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-06 20:40:16,294 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-04-06 20:40:16,337 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-06 20:40:16,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:16,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:16,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-04-06 20:40:16,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 20:40:16,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-04-06 20:40:16,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:16,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:16,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:16,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-06 20:40:16,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 20:40:16,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-04-06 20:40:16,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-04-06 20:40:16,613 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 10 treesize of output 9 [2018-04-06 20:40:16,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 20:40:16,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-04-06 20:40:16,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-04-06 20:40:16,712 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 10 treesize of output 9 [2018-04-06 20:40:16,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-06 20:40:16,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-04-06 20:40:16,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-04-06 20:40:16,784 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:16,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-04-06 20:40:16,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 20:40:16,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-06 20:40:16,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,802 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-06 20:40:16,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:40:16,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 20:40:16,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-04-06 20:40:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 20:40:16,860 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 20:40:17,393 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,394 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,397 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 292 [2018-04-06 20:40:17,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:17,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 174 [2018-04-06 20:40:17,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 20:40:17,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:17,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2018-04-06 20:40:17,650 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 110 DAG size of output 65 [2018-04-06 20:40:17,652 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 66 [2018-04-06 20:40:17,654 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-06 20:40:17,654 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:17,665 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 20:40:17,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 59 [2018-04-06 20:40:17,709 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2018-04-06 20:40:17,710 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:17,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 69 [2018-04-06 20:40:17,742 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-06 20:40:17,771 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:40:17,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-04-06 20:40:17,824 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,824 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,827 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 72 [2018-04-06 20:40:17,844 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-04-06 20:40:17,873 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 20:40:17,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-04-06 20:40:17,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2018-04-06 20:40:17,882 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-06 20:40:17,895 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:40:17,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-04-06 20:40:17,900 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-04-06 20:40:17,908 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-06 20:40:17,919 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 20:40:17,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2018-04-06 20:40:17,990 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:17,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-04-06 20:40:17,990 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:18,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-04-06 20:40:18,006 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-06 20:40:18,020 INFO L682 Elim1Store]: detected equality via solver [2018-04-06 20:40:18,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 69 [2018-04-06 20:40:18,038 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 3 xjuncts. [2018-04-06 20:40:18,066 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 20:40:18,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-06 20:40:18,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-06 20:40:18,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-06 20:40:18,186 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:130, output treesize:59 [2018-04-06 20:40:18,400 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 130 [2018-04-06 20:42:37,756 WARN L151 SmtUtils]: Spent 137226ms on a formula simplification. DAG size of input: 104 DAG size of output 75 [2018-04-06 20:42:37,765 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-04-06 20:43:14,043 WARN L148 SmtUtils]: Spent 27563ms on a formula simplification that was a NOOP. DAG size: 183 [2018-04-06 20:43:14,051 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 11 Received shutdown request... [2018-04-06 20:43:39,329 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-06 20:43:39,329 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 20:43:39,335 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 20:43:39,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 08:43:39 BoogieIcfgContainer [2018-04-06 20:43:39,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 20:43:39,336 INFO L168 Benchmark]: Toolchain (without parser) took 231656.68 ms. Allocated memory was 299.4 MB in the beginning and 3.3 GB in the end (delta: 3.0 GB). Free memory was 235.7 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.5 GB. Max. memory is 5.3 GB. [2018-04-06 20:43:39,337 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 299.4 MB. Free memory is still 261.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 20:43:39,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.84 ms. Allocated memory is still 299.4 MB. Free memory was 235.7 MB in the beginning and 209.5 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. [2018-04-06 20:43:39,338 INFO L168 Benchmark]: Boogie Preprocessor took 58.51 ms. Allocated memory is still 299.4 MB. Free memory was 209.5 MB in the beginning and 206.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-06 20:43:39,338 INFO L168 Benchmark]: RCFGBuilder took 689.68 ms. Allocated memory was 299.4 MB in the beginning and 456.7 MB in the end (delta: 157.3 MB). Free memory was 206.5 MB in the beginning and 372.9 MB in the end (delta: -166.3 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-04-06 20:43:39,338 INFO L168 Benchmark]: TraceAbstraction took 230562.90 ms. Allocated memory was 456.7 MB in the beginning and 3.3 GB in the end (delta: 2.8 GB). Free memory was 372.9 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 5.3 GB. [2018-04-06 20:43:39,339 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.21 ms. Allocated memory is still 299.4 MB. Free memory is still 261.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 340.84 ms. Allocated memory is still 299.4 MB. Free memory was 235.7 MB in the beginning and 209.5 MB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 58.51 ms. Allocated memory is still 299.4 MB. Free memory was 209.5 MB in the beginning and 206.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 689.68 ms. Allocated memory was 299.4 MB in the beginning and 456.7 MB in the end (delta: 157.3 MB). Free memory was 206.5 MB in the beginning and 372.9 MB in the end (delta: -166.3 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 230562.90 ms. Allocated memory was 456.7 MB in the beginning and 3.3 GB in the end (delta: 2.8 GB). Free memory was 372.9 MB in the beginning and 1.4 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.5 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 588]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 588). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 588]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 588). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 582]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 582). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 581]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 559]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 575]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 575). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 589]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 541]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 67 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while DnfTransformerHelper was transforming 11 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 179 locations, 55 error locations. TIMEOUT Result, 230.4s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1921 SDtfs, 4580 SDslu, 8331 SDs, 0 SdLazy, 4853 SolverSat, 323 SolverUnsat, 83 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1012 GetRequests, 776 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 17.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 654 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 926 ConstructedInterpolants, 275 QuantifiedInterpolants, 477478 SizeOfPredicates, 108 NumberOfNonLiveVariables, 2058 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 30 InterpolantComputations, 24 PerfectInterpolantSequences, 0/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_20-43-39-348.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/length_test03_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_20-43-39-348.csv Completed graceful shutdown