java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 14:58:44,167 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 14:58:44,169 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 14:58:44,182 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 14:58:44,182 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 14:58:44,183 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 14:58:44,184 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 14:58:44,185 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 14:58:44,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 14:58:44,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 14:58:44,188 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 14:58:44,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 14:58:44,189 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 14:58:44,190 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 14:58:44,191 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 14:58:44,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 14:58:44,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 14:58:44,195 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 14:58:44,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 14:58:44,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 14:58:44,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 14:58:44,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 14:58:44,199 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 14:58:44,200 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 14:58:44,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 14:58:44,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 14:58:44,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 14:58:44,202 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 14:58:44,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 14:58:44,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 14:58:44,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 14:58:44,204 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-04-11 14:58:44,225 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 14:58:44,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 14:58:44,226 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 14:58:44,226 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 14:58:44,226 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 14:58:44,227 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 14:58:44,227 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 14:58:44,227 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 14:58:44,227 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 14:58:44,227 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 14:58:44,227 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 14:58:44,227 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 14:58:44,228 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 14:58:44,228 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 14:58:44,228 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 14:58:44,228 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 14:58:44,228 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 14:58:44,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 14:58:44,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 14:58:44,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 14:58:44,229 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 14:58:44,229 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 14:58:44,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 14:58:44,268 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 14:58:44,271 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 14:58:44,272 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 14:58:44,273 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 14:58:44,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,609 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9c59cf300 [2018-04-11 14:58:44,731 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 14:58:44,732 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 14:58:44,732 INFO L168 CDTParser]: Scanning dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,740 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 14:58:44,740 INFO L215 ultiparseSymbolTable]: [2018-04-11 14:58:44,740 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 14:58:44,740 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,740 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 14:58:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ino_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,740 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ldiv_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____socklen_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsfilcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____mode_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__Colour in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__gid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,741 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_short in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____time_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsword_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ssize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_short in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,742 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____timer_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__idtype_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__mode_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____sig_atomic_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____nlink_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,743 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ssize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fd_mask in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__timer_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____pthread_slist_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__loff_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__id_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__uint in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_condattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,744 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__dev_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____qaddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blksize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____useconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____daddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__nlink_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutex_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__sigset_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__register_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_slong_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,745 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__time_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_int in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__clock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____gid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____off_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_long in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrier_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ulong in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____pid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ushort in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,746 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____loff_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__suseconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_mask in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____caddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__clockid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____dev_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_ulong_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____clock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__daddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,747 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__lldiv_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__uid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____id_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsblkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_set in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__blksize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__wchar_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_char in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__SLL in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,748 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__caddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____off64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____suseconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____sigset_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_once_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_attr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_spinlock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____clockid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_char in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_long in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__div_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____intptr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__size_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__off_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_cond_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__blkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:44,763 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9c59cf300 [2018-04-11 14:58:44,767 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 14:58:44,768 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 14:58:44,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 14:58:44,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 14:58:44,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 14:58:44,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:58:44" (1/1) ... [2018-04-11 14:58:44,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43721594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:44, skipping insertion in model container [2018-04-11 14:58:44,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 02:58:44" (1/1) ... [2018-04-11 14:58:44,785 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:58:44,808 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 14:58:44,938 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:58:44,976 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 14:58:44,982 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 14:58:45,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:45 WrapperNode [2018-04-11 14:58:45,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 14:58:45,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 14:58:45,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 14:58:45,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 14:58:45,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:45" (1/1) ... [2018-04-11 14:58:45,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:45" (1/1) ... [2018-04-11 14:58:45,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:45" (1/1) ... [2018-04-11 14:58:45,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:45" (1/1) ... [2018-04-11 14:58:45,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:45" (1/1) ... [2018-04-11 14:58:45,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:45" (1/1) ... [2018-04-11 14:58:45,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:45" (1/1) ... [2018-04-11 14:58:45,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 14:58:45,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 14:58:45,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 14:58:45,068 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 14:58:45,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:45" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 14:58:45,150 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 14:58:45,150 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 14:58:45,150 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 14:58:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 14:58:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 14:58:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 14:58:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 14:58:45,150 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 14:58:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 14:58:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 14:58:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 14:58:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 14:58:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 14:58:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 14:58:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 14:58:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 14:58:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 14:58:45,151 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 14:58:45,152 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 14:58:45,153 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 14:58:45,153 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 14:58:45,153 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 14:58:45,153 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 14:58:45,153 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 14:58:45,153 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 14:58:45,153 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 14:58:45,153 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 14:58:45,153 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 14:58:45,154 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 14:58:45,154 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 14:58:45,154 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 14:58:45,154 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 14:58:45,154 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 14:58:45,154 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 14:58:45,154 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 14:58:45,154 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 14:58:45,154 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 14:58:45,154 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 14:58:45,155 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 14:58:45,155 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 14:58:45,155 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 14:58:45,155 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 14:58:45,155 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 14:58:45,155 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 14:58:45,155 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 14:58:45,155 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 14:58:45,155 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 14:58:45,156 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 14:58:45,157 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 14:58:45,158 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 14:58:45,159 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 14:58:45,159 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 14:58:45,159 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 14:58:45,159 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 14:58:45,159 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 14:58:45,159 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 14:58:45,159 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 14:58:45,159 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 14:58:45,159 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 14:58:45,160 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 14:58:45,160 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 14:58:45,160 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 14:58:45,160 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 14:58:45,160 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 14:58:45,160 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 14:58:45,160 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 14:58:45,160 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 14:58:45,160 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 14:58:45,160 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 14:58:45,555 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 14:58:45,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:58:45 BoogieIcfgContainer [2018-04-11 14:58:45,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 14:58:45,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 14:58:45,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 14:58:45,558 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 14:58:45,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 02:58:44" (1/3) ... [2018-04-11 14:58:45,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa29258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:58:45, skipping insertion in model container [2018-04-11 14:58:45,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 02:58:45" (2/3) ... [2018-04-11 14:58:45,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa29258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 02:58:45, skipping insertion in model container [2018-04-11 14:58:45,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 02:58:45" (3/3) ... [2018-04-11 14:58:45,561 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 14:58:45,568 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-11 14:58:45,574 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-04-11 14:58:45,604 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 14:58:45,605 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 14:58:45,605 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 14:58:45,605 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-11 14:58:45,605 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-11 14:58:45,605 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 14:58:45,605 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 14:58:45,605 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 14:58:45,606 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 14:58:45,606 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 14:58:45,617 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-04-11 14:58:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 14:58:45,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:45,626 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:45,626 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:45,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483552, now seen corresponding path program 1 times [2018-04-11 14:58:45,674 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:45,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:45,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:45,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:58:45,767 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:45,768 INFO L182 omatonBuilderFactory]: Interpolants [144#true, 145#false, 146#(= 1 (select |#valid| |main_#t~malloc0.base|)), 147#(= 1 (select |#valid| main_~list~0.base))] [2018-04-11 14:58:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:45,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:58:45,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:58:45,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:58:45,780 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2018-04-11 14:58:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:45,965 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-04-11 14:58:45,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:58:45,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 14:58:45,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:45,974 INFO L225 Difference]: With dead ends: 157 [2018-04-11 14:58:45,975 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 14:58:45,976 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 14:58:46,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2018-04-11 14:58:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 14:58:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2018-04-11 14:58:46,011 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 8 [2018-04-11 14:58:46,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:46,011 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2018-04-11 14:58:46,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:58:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2018-04-11 14:58:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 14:58:46,012 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:46,012 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:46,012 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:46,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483551, now seen corresponding path program 1 times [2018-04-11 14:58:46,014 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:46,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:46,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:58:46,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,071 INFO L182 omatonBuilderFactory]: Interpolants [441#true, 442#false, 443#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 444#(and (= main_~list~0.offset 0) (= 12 (select |#length| main_~list~0.base)))] [2018-04-11 14:58:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:58:46,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:58:46,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:58:46,073 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 4 states. [2018-04-11 14:58:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:46,196 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-04-11 14:58:46,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 14:58:46,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 14:58:46,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:46,198 INFO L225 Difference]: With dead ends: 150 [2018-04-11 14:58:46,198 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 14:58:46,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 14:58:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-04-11 14:58:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 14:58:46,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-04-11 14:58:46,206 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 8 [2018-04-11 14:58:46,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:46,206 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-04-11 14:58:46,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:58:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-04-11 14:58:46,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 14:58:46,206 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:46,207 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:46,207 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:46,207 INFO L82 PathProgramCache]: Analyzing trace with hash -595612499, now seen corresponding path program 1 times [2018-04-11 14:58:46,209 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:46,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:46,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 14:58:46,276 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,276 INFO L182 omatonBuilderFactory]: Interpolants [736#false, 737#(= 1 (select |#valid| main_~list~0.base)), 738#(= 1 (select |#valid| main_~end~0.base)), 735#true] [2018-04-11 14:58:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 14:58:46,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 14:58:46,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 14:58:46,277 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 4 states. [2018-04-11 14:58:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:46,373 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-04-11 14:58:46,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:58:46,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 14:58:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:46,374 INFO L225 Difference]: With dead ends: 146 [2018-04-11 14:58:46,374 INFO L226 Difference]: Without dead ends: 146 [2018-04-11 14:58:46,374 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-11 14:58:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-04-11 14:58:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-11 14:58:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-04-11 14:58:46,377 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 16 [2018-04-11 14:58:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:46,378 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-04-11 14:58:46,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 14:58:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-04-11 14:58:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 14:58:46,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:46,378 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:46,378 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:46,378 INFO L82 PathProgramCache]: Analyzing trace with hash -595612498, now seen corresponding path program 1 times [2018-04-11 14:58:46,379 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:46,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:46,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:58:46,436 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,436 INFO L182 omatonBuilderFactory]: Interpolants [1017#true, 1018#false, 1019#(and (= 0 |main_#t~malloc0.offset|) (= 12 (select |#length| |main_#t~malloc0.base|))), 1020#(and (= 0 main_~list~0.offset) (= 12 (select |#length| main_~list~0.base))), 1021#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))] [2018-04-11 14:58:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:58:46,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:58:46,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:46,436 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 5 states. [2018-04-11 14:58:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:46,565 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2018-04-11 14:58:46,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:58:46,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 14:58:46,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:46,566 INFO L225 Difference]: With dead ends: 174 [2018-04-11 14:58:46,566 INFO L226 Difference]: Without dead ends: 174 [2018-04-11 14:58:46,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:58:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-11 14:58:46,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 145. [2018-04-11 14:58:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 14:58:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-04-11 14:58:46,571 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 16 [2018-04-11 14:58:46,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:46,571 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-04-11 14:58:46,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:58:46,571 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-04-11 14:58:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 14:58:46,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:46,572 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:46,572 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:46,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961200, now seen corresponding path program 1 times [2018-04-11 14:58:46,573 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:46,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:46,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:58:46,603 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,603 INFO L182 omatonBuilderFactory]: Interpolants [1345#true, 1346#false, 1347#(= 1 (select |#valid| |main_#t~malloc2.base|)), 1348#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 1349#(= 1 (select |#valid| |main_#t~mem3.base|))] [2018-04-11 14:58:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:58:46,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:58:46,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:46,604 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 5 states. [2018-04-11 14:58:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:46,739 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2018-04-11 14:58:46,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:58:46,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 14:58:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:46,740 INFO L225 Difference]: With dead ends: 203 [2018-04-11 14:58:46,740 INFO L226 Difference]: Without dead ends: 203 [2018-04-11 14:58:46,741 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:58:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-11 14:58:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 144. [2018-04-11 14:58:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-11 14:58:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-04-11 14:58:46,749 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 18 [2018-04-11 14:58:46,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:46,749 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-04-11 14:58:46,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:58:46,749 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-04-11 14:58:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 14:58:46,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:46,750 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:46,750 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:46,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961199, now seen corresponding path program 1 times [2018-04-11 14:58:46,758 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:46,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,832 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:46,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:58:46,833 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,833 INFO L182 omatonBuilderFactory]: Interpolants [1701#true, 1702#false, 1703#(and (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|)), 1704#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 1705#(and (= |main_#t~mem3.offset| 0) (= 12 (select |#length| |main_#t~mem3.base|)))] [2018-04-11 14:58:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:46,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:58:46,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:58:46,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:46,834 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 5 states. [2018-04-11 14:58:47,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:47,006 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-04-11 14:58:47,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:58:47,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 14:58:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:47,007 INFO L225 Difference]: With dead ends: 227 [2018-04-11 14:58:47,007 INFO L226 Difference]: Without dead ends: 227 [2018-04-11 14:58:47,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 14:58:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-11 14:58:47,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2018-04-11 14:58:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 14:58:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-04-11 14:58:47,013 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 18 [2018-04-11 14:58:47,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:47,013 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-04-11 14:58:47,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:58:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-04-11 14:58:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 14:58:47,014 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:47,014 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] [2018-04-11 14:58:47,015 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009646, now seen corresponding path program 1 times [2018-04-11 14:58:47,016 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:47,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:47,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:47,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 14:58:47,091 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:47,091 INFO L182 omatonBuilderFactory]: Interpolants [2082#true, 2083#false, 2084#(= (select |#valid| main_~list~0.base) 1), 2085#(= (select |#valid| main_~end~0.base) 1), 2086#(and (= 1 (select |#valid| |main_#t~malloc2.base|)) (not (= main_~end~0.base |main_#t~malloc2.base|))), 2087#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 2088#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 2089#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 2090#(= 1 (select |#valid| |main_#t~mem4.base|))] [2018-04-11 14:58:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:47,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 14:58:47,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 14:58:47,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:58:47,092 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 9 states. [2018-04-11 14:58:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:47,331 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-04-11 14:58:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 14:58:47,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-11 14:58:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:47,332 INFO L225 Difference]: With dead ends: 157 [2018-04-11 14:58:47,332 INFO L226 Difference]: Without dead ends: 157 [2018-04-11 14:58:47,332 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-11 14:58:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-11 14:58:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2018-04-11 14:58:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-11 14:58:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-04-11 14:58:47,336 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 22 [2018-04-11 14:58:47,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:47,336 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-04-11 14:58:47,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 14:58:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-04-11 14:58:47,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 14:58:47,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:47,337 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] [2018-04-11 14:58:47,337 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009645, now seen corresponding path program 1 times [2018-04-11 14:58:47,338 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:47,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:47,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:47,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:47,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 14:58:47,476 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:47,476 INFO L182 omatonBuilderFactory]: Interpolants [2400#true, 2401#false, 2402#(= (select |#valid| main_~list~0.base) 1), 2403#(= (select |#valid| main_~end~0.base) 1), 2404#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|)), 2405#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 2406#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 2407#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 2408#(and (= 12 (select |#length| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|)), 2409#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))] [2018-04-11 14:58:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:47,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 14:58:47,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 14:58:47,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 14:58:47,477 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 10 states. [2018-04-11 14:58:47,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:47,888 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-04-11 14:58:47,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 14:58:47,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-11 14:58:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:47,889 INFO L225 Difference]: With dead ends: 162 [2018-04-11 14:58:47,889 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 14:58:47,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-11 14:58:47,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 14:58:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 136. [2018-04-11 14:58:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 14:58:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-04-11 14:58:47,893 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 22 [2018-04-11 14:58:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:47,893 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-04-11 14:58:47,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 14:58:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-04-11 14:58:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 14:58:47,894 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:47,894 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] [2018-04-11 14:58:47,894 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:47,898 INFO L82 PathProgramCache]: Analyzing trace with hash -582468992, now seen corresponding path program 1 times [2018-04-11 14:58:47,900 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:47,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:47,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:47,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:47,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:58:47,941 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:47,941 INFO L182 omatonBuilderFactory]: Interpolants [2730#true, 2731#false, 2732#(not (= 0 |main_#t~malloc0.base|)), 2733#(not (= 0 main_~list~0.base)), 2734#(not (= 0 main_~end~0.base))] [2018-04-11 14:58:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:47,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:58:47,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:58:47,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:47,941 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 5 states. [2018-04-11 14:58:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:48,013 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-04-11 14:58:48,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:58:48,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-11 14:58:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:48,014 INFO L225 Difference]: With dead ends: 158 [2018-04-11 14:58:48,014 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 14:58:48,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:58:48,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 14:58:48,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2018-04-11 14:58:48,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 14:58:48,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-04-11 14:58:48,016 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 28 [2018-04-11 14:58:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:48,016 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-04-11 14:58:48,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:58:48,017 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-04-11 14:58:48,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 14:58:48,017 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:48,017 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-11 14:58:48,017 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:48,018 INFO L82 PathProgramCache]: Analyzing trace with hash -863319961, now seen corresponding path program 1 times [2018-04-11 14:58:48,019 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:48,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:48,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:58:48,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:48,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,094 INFO L182 omatonBuilderFactory]: Interpolants [3033#true, 3034#false, 3035#(= |main_#t~mem9| (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))), 3036#(= ~unnamed2~0~BLACK (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8))), 3037#(= ~unnamed2~0~BLACK |main_#t~mem10|)] [2018-04-11 14:58:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:58:48,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:58:48,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:48,094 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 5 states. [2018-04-11 14:58:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:48,224 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-04-11 14:58:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:58:48,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 14:58:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:48,225 INFO L225 Difference]: With dead ends: 147 [2018-04-11 14:58:48,225 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 14:58:48,226 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:58:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 14:58:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2018-04-11 14:58:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-11 14:58:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-04-11 14:58:48,229 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 29 [2018-04-11 14:58:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:48,229 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-04-11 14:58:48,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:58:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-04-11 14:58:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 14:58:48,230 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:48,230 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-11 14:58:48,230 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:48,230 INFO L82 PathProgramCache]: Analyzing trace with hash 759542753, now seen corresponding path program 1 times [2018-04-11 14:58:48,233 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:48,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,301 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:48,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:58:48,301 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,301 INFO L182 omatonBuilderFactory]: Interpolants [3322#true, 3323#false, 3324#(and (= 0 |main_#t~malloc6.offset|) (= 12 (select |#length| |main_#t~malloc6.base|))), 3325#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 3326#(and (= 12 (select |#length| |main_#t~mem7.base|)) (= |main_#t~mem7.offset| 0))] [2018-04-11 14:58:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:58:48,302 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:58:48,302 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:48,302 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 5 states. [2018-04-11 14:58:48,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:48,518 INFO L93 Difference]: Finished difference Result 233 states and 248 transitions. [2018-04-11 14:58:48,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:58:48,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 14:58:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:48,520 INFO L225 Difference]: With dead ends: 233 [2018-04-11 14:58:48,520 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 14:58:48,520 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 14:58:48,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 14:58:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 134. [2018-04-11 14:58:48,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 14:58:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-04-11 14:58:48,525 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 29 [2018-04-11 14:58:48,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:48,525 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-04-11 14:58:48,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:58:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-04-11 14:58:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 14:58:48,526 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:48,526 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-11 14:58:48,526 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:48,526 INFO L82 PathProgramCache]: Analyzing trace with hash 759542752, now seen corresponding path program 1 times [2018-04-11 14:58:48,527 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:48,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:48,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 14:58:48,584 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,585 INFO L182 omatonBuilderFactory]: Interpolants [3700#true, 3701#false, 3702#(= 1 (select |#valid| |main_#t~malloc6.base|)), 3703#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 3704#(= 1 (select |#valid| |main_#t~mem7.base|))] [2018-04-11 14:58:48,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-11 14:58:48,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:58:48,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:58:48,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:48,586 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 5 states. [2018-04-11 14:58:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:48,735 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-04-11 14:58:48,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 14:58:48,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 14:58:48,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:48,736 INFO L225 Difference]: With dead ends: 204 [2018-04-11 14:58:48,736 INFO L226 Difference]: Without dead ends: 204 [2018-04-11 14:58:48,736 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:58:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-11 14:58:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2018-04-11 14:58:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 14:58:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-11 14:58:48,740 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 29 [2018-04-11 14:58:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:48,740 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-11 14:58:48,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:58:48,740 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-11 14:58:48,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 14:58:48,741 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:48,741 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] [2018-04-11 14:58:48,741 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash -375834398, now seen corresponding path program 1 times [2018-04-11 14:58:48,745 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:48,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:48,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 14:58:48,852 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,853 INFO L182 omatonBuilderFactory]: Interpolants [4048#(= (select |#valid| main_~end~0.base) 1), 4049#(and (not (= main_~end~0.base |main_#t~malloc6.base|)) (= 1 (select |#valid| |main_#t~malloc6.base|))), 4050#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 4051#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base |main_#t~mem7.base|))), 4052#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 4053#(= 1 (select |#valid| |main_#t~mem8.base|)), 4046#true, 4047#false] [2018-04-11 14:58:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:48,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 14:58:48,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 14:58:48,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 14:58:48,854 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 8 states. [2018-04-11 14:58:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:49,058 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-04-11 14:58:49,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 14:58:49,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 14:58:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:49,059 INFO L225 Difference]: With dead ends: 139 [2018-04-11 14:58:49,059 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 14:58:49,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-11 14:58:49,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 14:58:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2018-04-11 14:58:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-11 14:58:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-04-11 14:58:49,063 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 33 [2018-04-11 14:58:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:49,063 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-04-11 14:58:49,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 14:58:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-04-11 14:58:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 14:58:49,064 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:49,064 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] [2018-04-11 14:58:49,064 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:49,064 INFO L82 PathProgramCache]: Analyzing trace with hash -375834397, now seen corresponding path program 1 times [2018-04-11 14:58:49,065 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:49,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:49,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:49,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 14:58:49,195 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:49,196 INFO L182 omatonBuilderFactory]: Interpolants [4336#(and (not (= main_~end~0.base |main_#t~malloc6.base|)) (= 0 |main_#t~malloc6.offset|) (= 12 (select |#length| |main_#t~malloc6.base|))), 4337#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4338#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 4339#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4340#(and (= 0 |main_#t~mem8.offset|) (= 12 (select |#length| |main_#t~mem8.base|))), 4341#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base))), 4333#true, 4334#false, 4335#(= (select |#valid| main_~end~0.base) 1)] [2018-04-11 14:58:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:49,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 14:58:49,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 14:58:49,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 14:58:49,197 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 9 states. [2018-04-11 14:58:49,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:49,432 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-04-11 14:58:49,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 14:58:49,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-11 14:58:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:49,432 INFO L225 Difference]: With dead ends: 136 [2018-04-11 14:58:49,432 INFO L226 Difference]: Without dead ends: 136 [2018-04-11 14:58:49,433 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-11 14:58:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-11 14:58:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2018-04-11 14:58:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 14:58:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-11 14:58:49,435 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 33 [2018-04-11 14:58:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:49,435 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-11 14:58:49,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 14:58:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-11 14:58:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 14:58:49,436 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:49,436 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:49,437 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash -736807832, now seen corresponding path program 1 times [2018-04-11 14:58:49,438 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:49,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:49,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:49,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 14:58:49,504 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:49,504 INFO L182 omatonBuilderFactory]: Interpolants [4608#false, 4609#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 4610#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 4611#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| 0)), 4607#true] [2018-04-11 14:58:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:49,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 14:58:49,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 14:58:49,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 14:58:49,505 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 5 states. [2018-04-11 14:58:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:49,618 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-04-11 14:58:49,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 14:58:49,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-11 14:58:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:49,619 INFO L225 Difference]: With dead ends: 138 [2018-04-11 14:58:49,619 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 14:58:49,619 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 14:58:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 14:58:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-04-11 14:58:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-11 14:58:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-04-11 14:58:49,622 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 35 [2018-04-11 14:58:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:49,623 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-04-11 14:58:49,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 14:58:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-04-11 14:58:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 14:58:49,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:49,624 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 14:58:49,624 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash -799952616, now seen corresponding path program 1 times [2018-04-11 14:58:49,625 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:49,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:49,884 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-11 14:58:49,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:58:49,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 14:58:49,885 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:49,886 INFO L182 omatonBuilderFactory]: Interpolants [4875#true, 4876#false, 4877#(= 0 |main_#t~malloc0.offset|), 4878#(= 0 main_~list~0.offset), 4879#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 4880#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 4881#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~malloc2.offset| main_~list~0.offset)), 4882#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 4883#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset)), 4884#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset)), 4885#(and (= |main_#t~mem4.offset| main_~list~0.offset) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 4886#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 4887#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 4888#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 4889#(or (= 1 (select |#valid| |main_#t~mem14.base|)) (and (= 0 |main_#t~mem14.offset|) (= 0 |main_#t~mem14.base|))), 4890#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (= 1 (select |#valid| main_~end~0.base))), 4891#(= 1 (select |#valid| main_~end~0.base))] [2018-04-11 14:58:49,886 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-11 14:58:49,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 14:58:49,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 14:58:49,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-11 14:58:49,887 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 17 states. [2018-04-11 14:58:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:50,602 INFO L93 Difference]: Finished difference Result 232 states and 245 transitions. [2018-04-11 14:58:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 14:58:50,602 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-11 14:58:50,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:50,603 INFO L225 Difference]: With dead ends: 232 [2018-04-11 14:58:50,603 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 14:58:50,603 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=1107, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 14:58:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 14:58:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 156. [2018-04-11 14:58:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-11 14:58:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2018-04-11 14:58:50,605 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 49 [2018-04-11 14:58:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:50,605 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2018-04-11 14:58:50,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 14:58:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2018-04-11 14:58:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 14:58:50,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:50,606 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 14:58:50,606 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -799952615, now seen corresponding path program 1 times [2018-04-11 14:58:50,607 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:50,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:50,860 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-11 14:58:50,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:58:50,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 14:58:50,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:50,860 INFO L182 omatonBuilderFactory]: Interpolants [5324#true, 5325#false, 5326#(= 0 |main_#t~malloc0.offset|), 5327#(= 0 main_~list~0.offset), 5328#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 5329#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 5330#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 12 (select |#length| |main_#t~malloc2.base|)) (= |main_#t~malloc2.offset| main_~list~0.offset) (= 0 |main_#t~malloc2.offset|)), 5331#(and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 5332#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset))), 5333#(and (= main_~end~0.base main_~list~0.base) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset))), 5334#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem4.offset| main_~list~0.offset) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5335#(or (and (not (= main_~end~0.base main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 5336#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))))), 5337#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 5338#(or (and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))) (and (= 0 |main_#t~mem14.offset|) (= 0 |main_#t~mem14.base|))), 5339#(or (and (= main_~end~0.offset 0) (= main_~end~0.base 0)) (and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))), 5340#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))] [2018-04-11 14:58:50,860 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-11 14:58:50,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 14:58:50,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 14:58:50,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-11 14:58:50,861 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand 17 states. [2018-04-11 14:58:51,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:51,722 INFO L93 Difference]: Finished difference Result 237 states and 253 transitions. [2018-04-11 14:58:51,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 14:58:51,723 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-11 14:58:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:51,723 INFO L225 Difference]: With dead ends: 237 [2018-04-11 14:58:51,723 INFO L226 Difference]: Without dead ends: 237 [2018-04-11 14:58:51,724 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 14:58:51,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-11 14:58:51,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 158. [2018-04-11 14:58:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 14:58:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-04-11 14:58:51,728 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 49 [2018-04-11 14:58:51,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:51,728 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-04-11 14:58:51,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 14:58:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-04-11 14:58:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 14:58:51,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:51,729 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] [2018-04-11 14:58:51,729 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash -7091430, now seen corresponding path program 1 times [2018-04-11 14:58:51,730 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:51,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:52,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:52,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:58:52,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 14:58:52,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:52,391 INFO L182 omatonBuilderFactory]: Interpolants [5792#(or (and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| 0)) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8))) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 5793#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8))) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5794#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (= 0 |main_#t~mem14.offset|) (= ~unnamed2~0~RED (select |#valid| 0)) (= 1 (select (select |#memory_int| |main_#t~mem14.base|) (+ 0 8)))), 5795#(and (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select (select |#memory_int| main_~end~0.base) (+ main_~end~0.offset 8)))), 5796#(and (= ~unnamed2~0~RED (select |#valid| 0)) (= 1 |main_#t~mem10|) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 5797#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 1 (select |#valid| 0))), 5798#(and (= 0 |main_#t~mem11.base|) (= 1 (select |#valid| 0))), 5799#(and (= 0 main_~end~0.base) (= 1 (select |#valid| 0))), 5776#true, 5777#false, 5778#(= ~unnamed2~0~RED (select |#valid| 0)), 5779#(and (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 |main_#t~malloc0.offset|)), 5780#(and (= 0 main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0))), 5781#(and (= 0 main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (= (select |#valid| main_~list~0.base) 1)), 5782#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (= (select |#valid| main_~end~0.base) 1)), 5783#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~malloc2.offset| main_~list~0.offset) (= 0 |main_#t~malloc2.offset|) (= ~unnamed2~0~RED (select |#valid| 0))), 5784#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5785#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5786#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 5787#(and (= |main_#t~mem4.offset| main_~list~0.offset) (= 0 |main_#t~mem4.offset|) (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= ~unnamed2~0~RED (select |#valid| 0)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem4.base|)), 5788#(or (and (= main_~list~0.offset 0) (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= ~unnamed2~0~RED (select |#valid| 0)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))), 5789#(or (and (= main_~list~0.offset 0) (= main_~end~0.offset 0) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5790#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.offset 0) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (+ main_~list~0.offset 8))) (= ~unnamed2~0~RED (select |#valid| 0))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 5791#(or (and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (+ 0 8))) (= ~unnamed2~0~RED (select |#valid| 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))] [2018-04-11 14:58:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:52,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 14:58:52,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 14:58:52,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-04-11 14:58:52,392 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 24 states. [2018-04-11 14:58:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:53,814 INFO L93 Difference]: Finished difference Result 249 states and 265 transitions. [2018-04-11 14:58:53,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 14:58:53,814 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-04-11 14:58:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:53,815 INFO L225 Difference]: With dead ends: 249 [2018-04-11 14:58:53,815 INFO L226 Difference]: Without dead ends: 249 [2018-04-11 14:58:53,816 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=400, Invalid=1670, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 14:58:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-11 14:58:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 155. [2018-04-11 14:58:53,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 14:58:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-04-11 14:58:53,820 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 53 [2018-04-11 14:58:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:53,820 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-04-11 14:58:53,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 14:58:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-04-11 14:58:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 14:58:53,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:53,821 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:53,821 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash -698335515, now seen corresponding path program 1 times [2018-04-11 14:58:53,822 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:53,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:54,070 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-11 14:58:54,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:58:54,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 14:58:54,070 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:54,071 INFO L182 omatonBuilderFactory]: Interpolants [6248#true, 6249#false, 6250#(= (select |#valid| main_~list~0.base) 1), 6251#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6252#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 6253#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6254#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6255#(and (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem4.base|))), 6256#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 6257#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 6258#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base |main_#t~malloc6.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc6.base|))), 6259#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6260#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= |main_#t~mem7.base| main_~list~0.base)) (not (= main_~end~0.base |main_#t~mem7.base|))), 6261#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1)), 6262#(and (not (= main_~list~0.base |main_#t~mem8.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6263#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6264#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 6265#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6266#(= 1 (select |#valid| |main_#t~mem14.base|)), 6267#(= 1 (select |#valid| main_~end~0.base))] [2018-04-11 14:58:54,071 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-11 14:58:54,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 14:58:54,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 14:58:54,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-04-11 14:58:54,072 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 20 states. [2018-04-11 14:58:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:54,724 INFO L93 Difference]: Finished difference Result 261 states and 276 transitions. [2018-04-11 14:58:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 14:58:54,724 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-04-11 14:58:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:54,725 INFO L225 Difference]: With dead ends: 261 [2018-04-11 14:58:54,725 INFO L226 Difference]: Without dead ends: 261 [2018-04-11 14:58:54,725 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=1182, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 14:58:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-04-11 14:58:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 189. [2018-04-11 14:58:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 14:58:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2018-04-11 14:58:54,727 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 58 [2018-04-11 14:58:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:54,728 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2018-04-11 14:58:54,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 14:58:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2018-04-11 14:58:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 14:58:54,728 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:54,728 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:54,728 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:54,728 INFO L82 PathProgramCache]: Analyzing trace with hash -698335514, now seen corresponding path program 1 times [2018-04-11 14:58:54,729 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:54,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:55,168 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-11 14:58:55,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:58:55,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 14:58:55,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:55,170 INFO L182 omatonBuilderFactory]: Interpolants [6756#true, 6757#false, 6758#(= (select |#valid| main_~list~0.base) 1), 6759#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 6760#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 12 (select |#length| |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|)), 6761#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6762#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 6763#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| |main_#t~mem4.base|)) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem4.base|))), 6764#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 6765#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~list~0.base) 1)), 6766#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base |main_#t~malloc6.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= main_~list~0.base |main_#t~malloc6.base|))), 6767#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 6768#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base)) (not (= |main_#t~mem7.base| main_~list~0.base)) (not (= main_~end~0.base |main_#t~mem7.base|))), 6769#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| main_~end~0.base))), 6770#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem8.base|)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6771#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6772#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 6773#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 6774#(and (= 0 |main_#t~mem14.offset|) (= 12 (select |#length| |main_#t~mem14.base|))), 6775#(and (= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)))] [2018-04-11 14:58:55,171 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-11 14:58:55,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 14:58:55,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 14:58:55,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-04-11 14:58:55,172 INFO L87 Difference]: Start difference. First operand 189 states and 202 transitions. Second operand 20 states. [2018-04-11 14:58:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:55,912 INFO L93 Difference]: Finished difference Result 265 states and 283 transitions. [2018-04-11 14:58:55,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 14:58:55,913 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 58 [2018-04-11 14:58:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:55,913 INFO L225 Difference]: With dead ends: 265 [2018-04-11 14:58:55,914 INFO L226 Difference]: Without dead ends: 265 [2018-04-11 14:58:55,914 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 14:58:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-04-11 14:58:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 191. [2018-04-11 14:58:55,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-11 14:58:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 204 transitions. [2018-04-11 14:58:55,916 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 204 transitions. Word has length 58 [2018-04-11 14:58:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:55,916 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 204 transitions. [2018-04-11 14:58:55,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 14:58:55,917 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 204 transitions. [2018-04-11 14:58:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 14:58:55,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:55,917 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:55,917 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:55,917 INFO L82 PathProgramCache]: Analyzing trace with hash -611631047, now seen corresponding path program 1 times [2018-04-11 14:58:55,918 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:55,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 14:58:55,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 14:58:55,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 14:58:55,953 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:55,954 INFO L182 omatonBuilderFactory]: Interpolants [7264#(or (not (= |main_#t~mem14.base| 0)) (not (= |main_#t~mem14.offset| 0))), 7265#(or (not (= main_~end~0.offset 0)) (not (= main_~end~0.base 0))), 7260#true, 7261#false, 7262#(and (= |main_#t~mem13.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= |main_#t~mem13.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 7263#(or (not (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 0)) (not (= (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset) 0)))] [2018-04-11 14:58:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 14:58:55,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 14:58:55,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 14:58:55,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 14:58:55,954 INFO L87 Difference]: Start difference. First operand 191 states and 204 transitions. Second operand 6 states. [2018-04-11 14:58:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:56,045 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-04-11 14:58:56,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 14:58:56,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-04-11 14:58:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:56,046 INFO L225 Difference]: With dead ends: 155 [2018-04-11 14:58:56,046 INFO L226 Difference]: Without dead ends: 155 [2018-04-11 14:58:56,046 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 14:58:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-11 14:58:56,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2018-04-11 14:58:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-11 14:58:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-04-11 14:58:56,048 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 58 [2018-04-11 14:58:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:56,048 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-04-11 14:58:56,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 14:58:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-04-11 14:58:56,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 14:58:56,048 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:56,049 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:56,049 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:56,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1513085733, now seen corresponding path program 2 times [2018-04-11 14:58:56,049 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:56,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:56,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:58:56,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 14:58:56,235 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:56,235 INFO L182 omatonBuilderFactory]: Interpolants [7584#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7585#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 7586#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 7587#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 7588#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 7589#(and (= |main_#t~mem13.offset| 0) (= |main_#t~mem13.base| 0)), 7576#true, 7577#false, 7578#(= (select |#valid| main_~list~0.base) 1), 7579#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7580#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 7581#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7582#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 7583#(and (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem4.base|)))] [2018-04-11 14:58:56,235 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:56,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 14:58:56,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 14:58:56,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-04-11 14:58:56,236 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 14 states. [2018-04-11 14:58:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:56,566 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2018-04-11 14:58:56,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 14:58:56,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 59 [2018-04-11 14:58:56,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:56,566 INFO L225 Difference]: With dead ends: 167 [2018-04-11 14:58:56,567 INFO L226 Difference]: Without dead ends: 142 [2018-04-11 14:58:56,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-04-11 14:58:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-11 14:58:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-04-11 14:58:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 14:58:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-04-11 14:58:56,568 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 59 [2018-04-11 14:58:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:56,568 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-04-11 14:58:56,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 14:58:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-04-11 14:58:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 14:58:56,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:56,569 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, 1, 1, 1, 1, 1] [2018-04-11 14:58:56,569 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:56,569 INFO L82 PathProgramCache]: Analyzing trace with hash 484223591, now seen corresponding path program 1 times [2018-04-11 14:58:56,570 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:56,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:56,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:58:56,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 14:58:56,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:56,886 INFO L182 omatonBuilderFactory]: Interpolants [7908#true, 7909#false, 7910#(= (select |#valid| main_~list~0.base) 1), 7911#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 7912#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 7913#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7914#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 7915#(and (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem4.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem4.base|)), 7916#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7917#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7918#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base |main_#t~malloc6.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc6.base|)) (= 1 (select |#valid| |main_#t~malloc6.base|)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 7919#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 7920#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= |main_#t~mem7.base| main_~list~0.base)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 7921#(and (not (= main_~list~0.base |main_#t~mem8.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem8.base|))), 7922#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 7923#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))), 7924#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)))), 7925#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))), 7926#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 7927#(= 1 (select |#valid| |main_#t~mem11.base|)), 7928#(= 1 (select |#valid| main_~end~0.base))] [2018-04-11 14:58:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:56,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 14:58:56,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 14:58:56,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-04-11 14:58:56,887 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 21 states. [2018-04-11 14:58:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:57,527 INFO L93 Difference]: Finished difference Result 176 states and 183 transitions. [2018-04-11 14:58:57,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 14:58:57,527 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-04-11 14:58:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:57,528 INFO L225 Difference]: With dead ends: 176 [2018-04-11 14:58:57,528 INFO L226 Difference]: Without dead ends: 176 [2018-04-11 14:58:57,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=1372, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 14:58:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-11 14:58:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 131. [2018-04-11 14:58:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 14:58:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-04-11 14:58:57,530 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 62 [2018-04-11 14:58:57,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:57,530 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-04-11 14:58:57,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 14:58:57,530 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-04-11 14:58:57,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 14:58:57,531 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:57,531 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, 1, 1, 1, 1, 1] [2018-04-11 14:58:57,531 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:57,531 INFO L82 PathProgramCache]: Analyzing trace with hash 484223592, now seen corresponding path program 1 times [2018-04-11 14:58:57,532 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:57,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:58,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:58:58,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 14:58:58,052 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:58,052 INFO L182 omatonBuilderFactory]: Interpolants [8288#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= |main_#t~mem7.base| main_~list~0.base)) (= |main_#t~mem7.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem7.base|))), 8289#(and (not (= main_~list~0.base |main_#t~mem8.base|)) (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem8.base|)) (= |main_#t~mem8.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 0 |main_#t~mem8.offset|) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 8290#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.offset 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 8291#(and (= main_~end~0.offset 0) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 8292#(and (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))))), 8293#(and (<= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))) (<= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) 0) (= 12 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)) (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))))), 8294#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| |main_#t~mem14.base|) |main_#t~mem14.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|)) (<= (select (select |#memory_$Pointer$.offset| |main_#t~mem14.base|) |main_#t~mem14.offset|) 0)), 8295#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (<= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (<= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) 0)), 8296#(and (<= 0 |main_#t~mem11.offset|) (= 12 (select |#length| |main_#t~mem11.base|)) (<= |main_#t~mem11.offset| 0)), 8297#(and (<= main_~end~0.offset 0) (= 12 (select |#length| main_~end~0.base)) (<= 0 main_~end~0.offset)), 8276#true, 8277#false, 8278#(= (select |#valid| main_~list~0.base) 1), 8279#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8280#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)), 8281#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8282#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 8283#(and (= |main_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (not (= main_~list~0.base |main_#t~mem4.base|)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset) |main_#t~mem4.base|)), 8284#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 8285#(and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 8286#(and (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base |main_#t~malloc6.base|)) (= 0 |main_#t~malloc6.offset|) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= 12 (select |#length| |main_#t~malloc6.base|)) (not (= main_~list~0.base |main_#t~malloc6.base|)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset))), 8287#(and (= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= main_~end~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)))] [2018-04-11 14:58:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:58,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 14:58:58,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 14:58:58,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-04-11 14:58:58,053 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 22 states. [2018-04-11 14:58:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:58:58,798 INFO L93 Difference]: Finished difference Result 174 states and 183 transitions. [2018-04-11 14:58:58,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 14:58:58,798 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2018-04-11 14:58:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:58:58,799 INFO L225 Difference]: With dead ends: 174 [2018-04-11 14:58:58,799 INFO L226 Difference]: Without dead ends: 174 [2018-04-11 14:58:58,799 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 14:58:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-11 14:58:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-04-11 14:58:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 14:58:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-04-11 14:58:58,801 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 62 [2018-04-11 14:58:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:58:58,801 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-04-11 14:58:58,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 14:58:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-04-11 14:58:58,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 14:58:58,801 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:58:58,801 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:58:58,802 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:58:58,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400824, now seen corresponding path program 3 times [2018-04-11 14:58:58,802 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:58:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:58:58,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:58:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:59,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:58:59,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 14:58:59,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:58:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:59,234 INFO L182 omatonBuilderFactory]: Interpolants [8640#(and (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8641#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1)), 8642#(and (= main_~end~0.offset main_~list~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset) main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= (select |#valid| main_~end~0.base) 1)), 8643#(and (= |main_#t~mem4.offset| main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 8644#(or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1))), 8645#(and (or (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)) (and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset))) (= (select |#valid| main_~end~0.base) 1)), 8646#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (or (and (= 1 (select |#valid| |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset)) (and (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc2.base|))))), 8647#(and (or (and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~list~0.offset))) (= main_~end~0.base main_~list~0.base)) (and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1))) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 8648#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= |main_#t~mem3.base| main_~list~0.base))), 8649#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 8650#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))) (not (= main_~list~0.base |main_#t~mem4.base|))), 8651#(and (not (= main_~end~0.base main_~list~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 8652#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset))), 8653#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 8654#(= 1 (select |#valid| |main_#t~mem14.base|)), 8655#(= 1 (select |#valid| main_~end~0.base)), 8633#true, 8634#false, 8635#(= 0 |main_#t~malloc0.offset|), 8636#(= 0 main_~list~0.offset), 8637#(and (= 0 main_~list~0.offset) (= (select |#valid| main_~list~0.base) 1)), 8638#(and (= main_~end~0.offset main_~list~0.offset) (= main_~list~0.base main_~end~0.base) (= 0 main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 8639#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.offset main_~list~0.offset) (= |main_#t~malloc2.offset| main_~list~0.offset) (= main_~list~0.base main_~end~0.base))] [2018-04-11 14:58:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:58:59,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 14:58:59,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 14:58:59,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-04-11 14:58:59,235 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 23 states. [2018-04-11 14:59:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:00,079 INFO L93 Difference]: Finished difference Result 216 states and 225 transitions. [2018-04-11 14:59:00,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 14:59:00,080 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-04-11 14:59:00,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:00,080 INFO L225 Difference]: With dead ends: 216 [2018-04-11 14:59:00,080 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 14:59:00,081 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=380, Invalid=1342, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 14:59:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 14:59:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 166. [2018-04-11 14:59:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-11 14:59:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 176 transitions. [2018-04-11 14:59:00,082 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 176 transitions. Word has length 63 [2018-04-11 14:59:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:00,082 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 176 transitions. [2018-04-11 14:59:00,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 14:59:00,083 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2018-04-11 14:59:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 14:59:00,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:00,083 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:00,083 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400823, now seen corresponding path program 2 times [2018-04-11 14:59:00,084 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 14:59:00,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 14:59:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:00,465 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 14:59:00,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 14:59:00,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-11 14:59:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:00,466 INFO L182 omatonBuilderFactory]: Interpolants [9088#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base)) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 9089#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base |main_#t~mem3.base|)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base)) (not (= |main_#t~mem3.base| main_~list~0.base))), 9090#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base))), 9091#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem4.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 9092#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 9093#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)))), 9094#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset))), 9095#(and (<= 12 (select |#length| |main_#t~mem14.base|)) (= 0 |main_#t~mem14.offset|)), 9096#(and (= main_~end~0.offset 0) (<= 12 (select |#length| main_~end~0.base))), 9076#true, 9077#false, 9078#(= (select |#valid| main_~list~0.base) 1), 9079#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= (select |#valid| main_~end~0.base) 1)), 9080#(and (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 |main_#t~malloc2.offset|)), 9081#(and (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))), 9082#(and (not (= main_~end~0.base |main_#t~mem3.base|)) (= main_~end~0.base main_~list~0.base) (= main_~end~0.offset main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (= |main_#t~mem3.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 9083#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~mem4.base|))), 9084#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~list~0.base) 1)), 9085#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (= (select |#valid| main_~end~0.base) 1) (<= 0 main_~end~0.offset) (= (select |#valid| main_~list~0.base) 1)), 9086#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (<= 12 (select |#length| main_~end~0.base)) (= (select |#valid| main_~end~0.base) 1) (= (select |#valid| main_~list~0.base) 1)), 9087#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) main_~list~0.offset)) (not (= main_~end~0.base main_~list~0.base)) (not (= main_~end~0.base |main_#t~malloc2.base|)) (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) main_~list~0.offset)) (not (= main_~list~0.base |main_#t~malloc2.base|)) (<= 12 (select |#length| main_~end~0.base)))] [2018-04-11 14:59:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 14:59:00,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 14:59:00,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 14:59:00,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-04-11 14:59:00,467 INFO L87 Difference]: Start difference. First operand 166 states and 176 transitions. Second operand 21 states. [2018-04-11 14:59:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 14:59:01,077 INFO L93 Difference]: Finished difference Result 214 states and 226 transitions. [2018-04-11 14:59:01,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 14:59:01,077 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-04-11 14:59:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 14:59:01,078 INFO L225 Difference]: With dead ends: 214 [2018-04-11 14:59:01,078 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 14:59:01,078 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 14:59:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 14:59:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 168. [2018-04-11 14:59:01,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 14:59:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-04-11 14:59:01,080 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 63 [2018-04-11 14:59:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 14:59:01,080 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-04-11 14:59:01,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 14:59:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-04-11 14:59:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 14:59:01,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 14:59:01,080 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 14:59:01,080 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 14:59:01,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1290037367, now seen corresponding path program 1 times [2018-04-11 14:59:01,081 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 14:59:01,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:59:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 14:59:01,120 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 14:59:01,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 02:59:01 BoogieIcfgContainer [2018-04-11 14:59:01,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 14:59:01,153 INFO L168 Benchmark]: Toolchain (without parser) took 16385.74 ms. Allocated memory was 402.1 MB in the beginning and 922.7 MB in the end (delta: 520.6 MB). Free memory was 333.0 MB in the beginning and 492.5 MB in the end (delta: -159.6 MB). Peak memory consumption was 361.0 MB. Max. memory is 5.3 GB. [2018-04-11 14:59:01,154 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 14:59:01,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.10 ms. Allocated memory is still 402.1 MB. Free memory was 333.0 MB in the beginning and 306.5 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-11 14:59:01,154 INFO L168 Benchmark]: Boogie Preprocessor took 46.35 ms. Allocated memory is still 402.1 MB. Free memory was 306.5 MB in the beginning and 303.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 14:59:01,155 INFO L168 Benchmark]: RCFGBuilder took 487.66 ms. Allocated memory was 402.1 MB in the beginning and 589.3 MB in the end (delta: 187.2 MB). Free memory was 303.9 MB in the beginning and 508.2 MB in the end (delta: -204.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. [2018-04-11 14:59:01,155 INFO L168 Benchmark]: TraceAbstraction took 15596.65 ms. Allocated memory was 589.3 MB in the beginning and 922.7 MB in the end (delta: 333.4 MB). Free memory was 508.2 MB in the beginning and 492.5 MB in the end (delta: 15.7 MB). Peak memory consumption was 349.1 MB. Max. memory is 5.3 GB. [2018-04-11 14:59:01,156 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.15 ms. Allocated memory is still 402.1 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 252.10 ms. Allocated memory is still 402.1 MB. Free memory was 333.0 MB in the beginning and 306.5 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.35 ms. Allocated memory is still 402.1 MB. Free memory was 306.5 MB in the beginning and 303.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 487.66 ms. Allocated memory was 402.1 MB in the beginning and 589.3 MB in the end (delta: 187.2 MB). Free memory was 303.9 MB in the beginning and 508.2 MB in the end (delta: -204.4 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15596.65 ms. Allocated memory was 589.3 MB in the beginning and 922.7 MB in the end (delta: 333.4 MB). Free memory was 508.2 MB in the beginning and 492.5 MB in the end (delta: 15.7 MB). Peak memory consumption was 349.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={16:0}] [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L995] FCALL list->next = ((void*)0) VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L996] FCALL list->prev = ((void*)0) VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L997] FCALL list->colour = BLACK VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L999] SLL* end = list; VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1006] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1006] FCALL end->next->prev = end VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1007] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1017] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1017] FCALL end->next = malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1018] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1018] FCALL end->next->prev = end VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1019] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1021] FCALL end->colour = BLACK VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1030] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1030] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1032] COND TRUE ((void*)0) != end VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1034] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1040] COND FALSE !(!(end->next)) [L1040] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1041] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1034] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=0, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1036] end = end->next [L1037] EXPR, FCALL end->next VAL [end={15:0}, end->next={0:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}] [L1037] end = end->next [L1040] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 59 error locations. UNSAFE Result, 15.5s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1993 SDtfs, 7101 SDslu, 7953 SDs, 0 SdLazy, 13433 SolverSat, 1137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 47 SyntacticMatches, 9 SemanticMatches, 466 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 17/118 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, 26 MinimizatonAttempts, 1091 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1043 NumberOfCodeBlocks, 1043 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 952 ConstructedInterpolants, 0 QuantifiedInterpolants, 674413 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 17/118 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_14-59-01-162.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_14-59-01-162.csv Received shutdown request...