java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 15:43:59,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 15:43:59,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 15:43:59,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 15:43:59,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 15:43:59,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 15:43:59,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 15:43:59,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 15:43:59,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 15:43:59,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 15:43:59,741 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 15:43:59,741 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 15:43:59,742 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 15:43:59,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 15:43:59,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 15:43:59,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 15:43:59,747 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 15:43:59,748 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 15:43:59,749 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 15:43:59,750 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 15:43:59,752 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 15:43:59,752 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 15:43:59,752 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 15:43:59,753 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 15:43:59,754 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 15:43:59,755 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 15:43:59,755 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 15:43:59,756 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 15:43:59,756 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 15:43:59,756 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 15:43:59,757 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 15:43:59,757 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-10 15:43:59,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 15:43:59,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 15:43:59,774 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 15:43:59,774 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 15:43:59,774 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 15:43:59,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 15:43:59,774 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 15:43:59,774 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 15:43:59,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 15:43:59,775 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 15:43:59,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 15:43:59,775 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 15:43:59,775 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 15:43:59,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 15:43:59,775 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 15:43:59,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 15:43:59,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 15:43:59,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 15:43:59,775 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 15:43:59,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:43:59,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 15:43:59,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-04-10 15:43:59,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 15:43:59,816 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 15:43:59,819 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 15:43:59,820 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 15:43:59,820 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 15:43:59,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,117 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf0850b365 [2018-04-10 15:44:00,252 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 15:44:00,252 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 15:44:00,253 INFO L168 CDTParser]: Scanning sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,260 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 15:44:00,261 INFO L215 ultiparseSymbolTable]: [2018-04-10 15:44:00,261 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 15:44:00,261 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,261 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 15:44:00,261 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____time_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,261 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____timer_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,261 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,261 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____intptr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__idtype_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__size_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____mode_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_mutex_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsfilcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsfilcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__caddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_short in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__time_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__div_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__off_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____suseconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ldiv_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsfilcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ino_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____socklen_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__lldiv_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____rlim_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__uid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_rwlock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__register_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsblkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_attr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____off64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____sig_atomic_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____syscall_ulong_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsword_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__uint in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__sigset_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__nlink_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ssize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_char in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsblkcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____nlink_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____pthread_slist_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blkcnt64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsblkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int32_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____id_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fd_mask in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ssize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__timer_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__clockid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ino_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____syscall_slong_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____pid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ushort in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____gid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_long in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____off_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fd_mask in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_barrier_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____sigset_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____fsid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____ino64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____uint8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____key_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_spinlock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__id_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____useconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_long in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__dev_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__wchar_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_cond_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_int16_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_int in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_char in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__blkcnt_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____clockid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____caddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__u_quad_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____blksize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_once_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__blksize_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____qaddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____rlim64_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__loff_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__SLL in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____daddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__gid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__ulong in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____clock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__pthread_condattr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fd_set in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__daddr_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____u_short in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__fsid_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__clock_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__mode_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i__suseconds_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____int8_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____dev_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll____false_unreach_call_false_valid_deref_i____loff_t in sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:00,304 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf0850b365 [2018-04-10 15:44:00,308 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 15:44:00,309 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 15:44:00,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 15:44:00,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 15:44:00,315 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 15:44:00,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:44:00" (1/1) ... [2018-04-10 15:44:00,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eab92f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00, skipping insertion in model container [2018-04-10 15:44:00,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:44:00" (1/1) ... [2018-04-10 15:44:00,335 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:44:00,363 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:44:00,501 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:44:00,544 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:44:00,550 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-10 15:44:00,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00 WrapperNode [2018-04-10 15:44:00,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 15:44:00,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 15:44:00,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 15:44:00,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 15:44:00,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00" (1/1) ... [2018-04-10 15:44:00,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00" (1/1) ... [2018-04-10 15:44:00,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00" (1/1) ... [2018-04-10 15:44:00,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00" (1/1) ... [2018-04-10 15:44:00,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00" (1/1) ... [2018-04-10 15:44:00,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00" (1/1) ... [2018-04-10 15:44:00,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00" (1/1) ... [2018-04-10 15:44:00,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 15:44:00,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 15:44:00,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 15:44:00,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 15:44:00,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00" (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-10 15:44:00,732 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 15:44:00,732 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 15:44:00,732 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 15:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 15:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 15:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 15:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 15:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 15:44:00,734 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 15:44:00,734 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 15:44:00,734 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 15:44:00,734 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 15:44:00,734 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 15:44:00,734 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 15:44:00,734 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 15:44:00,734 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 15:44:00,734 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 15:44:00,735 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 15:44:00,735 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 15:44:00,735 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 15:44:00,735 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 15:44:00,735 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 15:44:00,735 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 15:44:00,735 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 15:44:00,735 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 15:44:00,735 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 15:44:00,736 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 15:44:00,736 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 15:44:00,736 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 15:44:00,736 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 15:44:00,736 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 15:44:00,736 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 15:44:00,736 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 15:44:00,736 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 15:44:00,736 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 15:44:00,737 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 15:44:00,737 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 15:44:00,737 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 15:44:00,737 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 15:44:00,737 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 15:44:00,737 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 15:44:00,737 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 15:44:00,737 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 15:44:00,737 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 15:44:00,738 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 15:44:00,738 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 15:44:00,738 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 15:44:00,738 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 15:44:00,738 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 15:44:00,738 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 15:44:00,738 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 15:44:00,738 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 15:44:00,738 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 15:44:00,738 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 15:44:00,739 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 15:44:00,739 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 15:44:00,739 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 15:44:00,739 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 15:44:00,739 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 15:44:00,739 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 15:44:00,739 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 15:44:00,739 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 15:44:00,739 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 15:44:00,739 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 15:44:00,740 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 15:44:00,740 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 15:44:00,740 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 15:44:00,740 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 15:44:00,740 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 15:44:00,740 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 15:44:00,740 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 15:44:00,740 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 15:44:00,740 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 15:44:00,740 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 15:44:00,741 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 15:44:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 15:44:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 15:44:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 15:44:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 15:44:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 15:44:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 15:44:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 15:44:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 15:44:00,742 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 15:44:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 15:44:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 15:44:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 15:44:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 15:44:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 15:44:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 15:44:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 15:44:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 15:44:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 15:44:00,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 15:44:00,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 15:44:01,326 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 15:44:01,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:44:01 BoogieIcfgContainer [2018-04-10 15:44:01,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 15:44:01,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 15:44:01,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 15:44:01,330 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 15:44:01,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 03:44:00" (1/3) ... [2018-04-10 15:44:01,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f538ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:44:01, skipping insertion in model container [2018-04-10 15:44:01,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:44:00" (2/3) ... [2018-04-10 15:44:01,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f538ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:44:01, skipping insertion in model container [2018-04-10 15:44:01,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:44:01" (3/3) ... [2018-04-10 15:44:01,349 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-04-10 15:44:01,356 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-10 15:44:01,364 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-10 15:44:01,422 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 15:44:01,423 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 15:44:01,423 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 15:44:01,423 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-10 15:44:01,423 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-10 15:44:01,423 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 15:44:01,423 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 15:44:01,423 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 15:44:01,423 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 15:44:01,424 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 15:44:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2018-04-10 15:44:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 15:44:01,445 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:01,446 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:01,446 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:01,448 INFO L82 PathProgramCache]: Analyzing trace with hash 424313087, now seen corresponding path program 1 times [2018-04-10 15:44:01,511 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:01,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:01,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-10 15:44:01,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:01,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:44:01,608 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:01,609 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-10 15:44:01,609 INFO L182 omatonBuilderFactory]: Interpolants [195#true, 196#false, 197#(= 1 (select |#valid| |main_#t~malloc0.base|)), 198#(= 1 (select |#valid| main_~list~0.base))] [2018-04-10 15:44:01,609 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-10 15:44:01,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:44:01,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:44:01,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:44:01,625 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 4 states. [2018-04-10 15:44:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:01,801 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2018-04-10 15:44:01,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:44:01,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 15:44:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:01,809 INFO L225 Difference]: With dead ends: 223 [2018-04-10 15:44:01,810 INFO L226 Difference]: Without dead ends: 219 [2018-04-10 15:44:01,811 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-10 15:44:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-10 15:44:01,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 185. [2018-04-10 15:44:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-10 15:44:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2018-04-10 15:44:01,842 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 8 [2018-04-10 15:44:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:01,842 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2018-04-10 15:44:01,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:44:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2018-04-10 15:44:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 15:44:01,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:01,843 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:01,843 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:01,843 INFO L82 PathProgramCache]: Analyzing trace with hash 424313088, now seen corresponding path program 1 times [2018-04-10 15:44:01,844 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:01,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:01,908 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-10 15:44:01,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:01,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:44:01,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:01,910 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-10 15:44:01,910 INFO L182 omatonBuilderFactory]: Interpolants [609#true, 610#false, 611#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 612#(and (= main_~list~0.offset 0) (= 8 (select |#length| main_~list~0.base)))] [2018-04-10 15:44:01,910 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-10 15:44:01,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:44:01,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:44:01,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:44:01,913 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand 4 states. [2018-04-10 15:44:02,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:02,077 INFO L93 Difference]: Finished difference Result 212 states and 224 transitions. [2018-04-10 15:44:02,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:44:02,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 15:44:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:02,078 INFO L225 Difference]: With dead ends: 212 [2018-04-10 15:44:02,078 INFO L226 Difference]: Without dead ends: 212 [2018-04-10 15:44:02,079 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-10 15:44:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-10 15:44:02,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 199. [2018-04-10 15:44:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 15:44:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2018-04-10 15:44:02,090 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 8 [2018-04-10 15:44:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:02,090 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2018-04-10 15:44:02,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:44:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2018-04-10 15:44:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 15:44:02,091 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:02,091 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:02,091 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:02,091 INFO L82 PathProgramCache]: Analyzing trace with hash -840809059, now seen corresponding path program 1 times [2018-04-10 15:44:02,093 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:02,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:02,144 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-10 15:44:02,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:02,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:44:02,145 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:02,145 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-10 15:44:02,145 INFO L182 omatonBuilderFactory]: Interpolants [1026#true, 1027#false, 1028#(= 1 (select |#valid| |main_#t~malloc2.base|)), 1029#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 1030#(= 1 (select |#valid| |main_#t~mem3.base|))] [2018-04-10 15:44:02,145 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-10 15:44:02,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:44:02,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:44:02,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:44:02,146 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 5 states. [2018-04-10 15:44:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:02,475 INFO L93 Difference]: Finished difference Result 339 states and 368 transitions. [2018-04-10 15:44:02,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:44:02,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 15:44:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:02,476 INFO L225 Difference]: With dead ends: 339 [2018-04-10 15:44:02,476 INFO L226 Difference]: Without dead ends: 339 [2018-04-10 15:44:02,476 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-10 15:44:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-04-10 15:44:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 198. [2018-04-10 15:44:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-10 15:44:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 218 transitions. [2018-04-10 15:44:02,482 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 218 transitions. Word has length 17 [2018-04-10 15:44:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:02,482 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 218 transitions. [2018-04-10 15:44:02,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:44:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 218 transitions. [2018-04-10 15:44:02,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 15:44:02,483 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:02,483 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:02,483 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash -840809058, now seen corresponding path program 1 times [2018-04-10 15:44:02,484 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:02,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:02,539 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-10 15:44:02,539 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:02,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:44:02,539 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:02,540 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-10 15:44:02,540 INFO L182 omatonBuilderFactory]: Interpolants [1574#true, 1575#false, 1576#(and (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|))), 1577#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 1578#(and (= |main_#t~mem3.offset| 0) (= 8 (select |#length| |main_#t~mem3.base|)))] [2018-04-10 15:44:02,540 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-10 15:44:02,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:44:02,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:44:02,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:44:02,541 INFO L87 Difference]: Start difference. First operand 198 states and 218 transitions. Second operand 5 states. [2018-04-10 15:44:02,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:02,740 INFO L93 Difference]: Finished difference Result 370 states and 409 transitions. [2018-04-10 15:44:02,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:44:02,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 15:44:02,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:02,741 INFO L225 Difference]: With dead ends: 370 [2018-04-10 15:44:02,742 INFO L226 Difference]: Without dead ends: 370 [2018-04-10 15:44:02,742 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-10 15:44:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-04-10 15:44:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 197. [2018-04-10 15:44:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-10 15:44:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2018-04-10 15:44:02,751 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 17 [2018-04-10 15:44:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:02,752 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2018-04-10 15:44:02,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:44:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2018-04-10 15:44:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 15:44:02,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:02,753 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] [2018-04-10 15:44:02,753 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash -293392460, now seen corresponding path program 1 times [2018-04-10 15:44:02,754 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:02,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:02,858 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-10 15:44:02,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:02,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 15:44:02,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:02,859 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-10 15:44:02,859 INFO L182 omatonBuilderFactory]: Interpolants [2152#true, 2153#false, 2154#(= (select |#valid| main_~list~0.base) 1), 2155#(and (= 1 (select |#valid| |main_#t~malloc2.base|)) (not (= main_~list~0.base |main_#t~malloc2.base|))), 2156#(and (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 2157#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~list~0.base |main_#t~mem3.base|))), 2158#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 2159#(= 1 (select |#valid| |main_#t~mem4.base|))] [2018-04-10 15:44:02,859 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-10 15:44:02,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:44:02,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:44:02,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:44:02,860 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand 8 states. [2018-04-10 15:44:03,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:03,317 INFO L93 Difference]: Finished difference Result 342 states and 369 transitions. [2018-04-10 15:44:03,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:44:03,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-10 15:44:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:03,318 INFO L225 Difference]: With dead ends: 342 [2018-04-10 15:44:03,319 INFO L226 Difference]: Without dead ends: 342 [2018-04-10 15:44:03,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:44:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-10 15:44:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 196. [2018-04-10 15:44:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-10 15:44:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2018-04-10 15:44:03,338 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 20 [2018-04-10 15:44:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:03,338 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2018-04-10 15:44:03,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:44:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2018-04-10 15:44:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-10 15:44:03,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:03,339 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] [2018-04-10 15:44:03,339 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:03,339 INFO L82 PathProgramCache]: Analyzing trace with hash -293392459, now seen corresponding path program 1 times [2018-04-10 15:44:03,340 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:03,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:03,463 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-10 15:44:03,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:03,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 15:44:03,464 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:03,464 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-10 15:44:03,464 INFO L182 omatonBuilderFactory]: Interpolants [2708#true, 2709#false, 2710#(= (select |#valid| main_~list~0.base) 1), 2711#(and (not (= main_~list~0.base |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|))), 2712#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 2713#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~list~0.base |main_#t~mem3.base|))), 2714#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 2715#(and (= |main_#t~mem4.offset| 0) (= 8 (select |#length| |main_#t~mem4.base|)))] [2018-04-10 15:44:03,464 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-10 15:44:03,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:44:03,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:44:03,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:44:03,465 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand 8 states. [2018-04-10 15:44:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:03,944 INFO L93 Difference]: Finished difference Result 344 states and 371 transitions. [2018-04-10 15:44:03,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:44:03,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-10 15:44:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:03,945 INFO L225 Difference]: With dead ends: 344 [2018-04-10 15:44:03,945 INFO L226 Difference]: Without dead ends: 344 [2018-04-10 15:44:03,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:44:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-10 15:44:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 195. [2018-04-10 15:44:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-10 15:44:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 215 transitions. [2018-04-10 15:44:03,951 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 215 transitions. Word has length 20 [2018-04-10 15:44:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:03,951 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 215 transitions. [2018-04-10 15:44:03,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:44:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 215 transitions. [2018-04-10 15:44:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-10 15:44:03,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:03,952 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:03,952 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:03,952 INFO L82 PathProgramCache]: Analyzing trace with hash 671159677, now seen corresponding path program 1 times [2018-04-10 15:44:03,953 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:03,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:04,001 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-10 15:44:04,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:04,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:44:04,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:04,002 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-10 15:44:04,002 INFO L182 omatonBuilderFactory]: Interpolants [3265#true, 3266#false, 3267#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 3268#(and (= |main_#t~mem5.base| 0) (= |main_#t~mem5.offset| 0)), 3269#(not |main_#t~short7|)] [2018-04-10 15:44:04,002 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-10 15:44:04,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:44:04,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:44:04,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:44:04,003 INFO L87 Difference]: Start difference. First operand 195 states and 215 transitions. Second operand 5 states. [2018-04-10 15:44:04,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:04,084 INFO L93 Difference]: Finished difference Result 292 states and 318 transitions. [2018-04-10 15:44:04,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:44:04,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-10 15:44:04,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:04,086 INFO L225 Difference]: With dead ends: 292 [2018-04-10 15:44:04,086 INFO L226 Difference]: Without dead ends: 292 [2018-04-10 15:44:04,086 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-10 15:44:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-10 15:44:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 199. [2018-04-10 15:44:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-10 15:44:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 219 transitions. [2018-04-10 15:44:04,091 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 219 transitions. Word has length 26 [2018-04-10 15:44:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:04,091 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 219 transitions. [2018-04-10 15:44:04,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:44:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 219 transitions. [2018-04-10 15:44:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 15:44:04,092 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:04,092 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-10 15:44:04,092 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:04,092 INFO L82 PathProgramCache]: Analyzing trace with hash -903005022, now seen corresponding path program 1 times [2018-04-10 15:44:04,093 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:04,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:04,123 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-10 15:44:04,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:04,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:44:04,123 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:04,123 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-10 15:44:04,124 INFO L182 omatonBuilderFactory]: Interpolants [3765#true, 3766#false, 3767#(= 1 (select |#valid| main_~list~0.base)), 3768#(= 1 (select |#valid| main_~end~0.base))] [2018-04-10 15:44:04,124 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-10 15:44:04,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:44:04,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:44:04,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:44:04,124 INFO L87 Difference]: Start difference. First operand 199 states and 219 transitions. Second operand 4 states. [2018-04-10 15:44:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:04,202 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2018-04-10 15:44:04,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:44:04,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-10 15:44:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:04,203 INFO L225 Difference]: With dead ends: 203 [2018-04-10 15:44:04,203 INFO L226 Difference]: Without dead ends: 203 [2018-04-10 15:44:04,204 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-10 15:44:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-10 15:44:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 191. [2018-04-10 15:44:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-10 15:44:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-04-10 15:44:04,208 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 28 [2018-04-10 15:44:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:04,209 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-04-10 15:44:04,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:44:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-04-10 15:44:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 15:44:04,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:04,210 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-10 15:44:04,210 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash -903005021, now seen corresponding path program 1 times [2018-04-10 15:44:04,211 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:04,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:04,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:44:04,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:04,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 15:44:04,287 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:04,287 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-10 15:44:04,287 INFO L182 omatonBuilderFactory]: Interpolants [4165#true, 4166#false, 4167#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 4168#(and (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base))), 4169#(and (= 1 (select |#valid| main_~list~0.base)) (= 0 main_~list~0.offset) (= 8 (select |#length| main_~list~0.base))), 4170#(and (= main_~end~0.offset 0) (= (select |#valid| main_~end~0.base) 1) (= 8 (select |#length| main_~end~0.base))), 4171#(and (= main_~end~0.offset 0) (= 8 (select |#length| main_~end~0.base)))] [2018-04-10 15:44:04,287 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-10 15:44:04,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:44:04,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:44:04,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:44:04,288 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 7 states. [2018-04-10 15:44:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:04,489 INFO L93 Difference]: Finished difference Result 250 states and 267 transitions. [2018-04-10 15:44:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:44:04,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-04-10 15:44:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:04,490 INFO L225 Difference]: With dead ends: 250 [2018-04-10 15:44:04,490 INFO L226 Difference]: Without dead ends: 250 [2018-04-10 15:44:04,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:44:04,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-10 15:44:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 221. [2018-04-10 15:44:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-10 15:44:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 252 transitions. [2018-04-10 15:44:04,493 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 252 transitions. Word has length 28 [2018-04-10 15:44:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:04,493 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 252 transitions. [2018-04-10 15:44:04,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:44:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 252 transitions. [2018-04-10 15:44:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 15:44:04,494 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:04,494 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] [2018-04-10 15:44:04,494 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2042365947, now seen corresponding path program 1 times [2018-04-10 15:44:04,495 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:04,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:04,545 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-10 15:44:04,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:04,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:44:04,545 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:04,545 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-10 15:44:04,546 INFO L182 omatonBuilderFactory]: Interpolants [4649#true, 4650#false, 4651#(= 1 (select |#valid| |main_#t~malloc9.base|)), 4652#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset))), 4653#(= 1 (select |#valid| |main_#t~mem10.base|)), 4654#(= 1 (select |#valid| main_~end~0.base))] [2018-04-10 15:44:04,546 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-10 15:44:04,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:44:04,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:44:04,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:44:04,546 INFO L87 Difference]: Start difference. First operand 221 states and 252 transitions. Second operand 6 states. [2018-04-10 15:44:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:04,730 INFO L93 Difference]: Finished difference Result 321 states and 369 transitions. [2018-04-10 15:44:04,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:44:04,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-10 15:44:04,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:04,731 INFO L225 Difference]: With dead ends: 321 [2018-04-10 15:44:04,731 INFO L226 Difference]: Without dead ends: 321 [2018-04-10 15:44:04,731 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:44:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-10 15:44:04,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 220. [2018-04-10 15:44:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-10 15:44:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 251 transitions. [2018-04-10 15:44:04,735 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 251 transitions. Word has length 31 [2018-04-10 15:44:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:04,736 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 251 transitions. [2018-04-10 15:44:04,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:44:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 251 transitions. [2018-04-10 15:44:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-10 15:44:04,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:04,736 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] [2018-04-10 15:44:04,736 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:04,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2042365946, now seen corresponding path program 1 times [2018-04-10 15:44:04,737 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:04,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:04,807 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-10 15:44:04,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:04,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:44:04,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:04,808 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-10 15:44:04,808 INFO L182 omatonBuilderFactory]: Interpolants [5203#true, 5204#false, 5205#(and (= 0 |main_#t~malloc9.offset|) (= 8 (select |#length| |main_#t~malloc9.base|))), 5206#(and (= 8 (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))), 5207#(and (= 8 (select |#length| |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|)), 5208#(and (= main_~end~0.offset 0) (= 8 (select |#length| main_~end~0.base)))] [2018-04-10 15:44:04,809 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-10 15:44:04,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:44:04,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:44:04,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:44:04,809 INFO L87 Difference]: Start difference. First operand 220 states and 251 transitions. Second operand 6 states. [2018-04-10 15:44:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:05,098 INFO L93 Difference]: Finished difference Result 345 states and 401 transitions. [2018-04-10 15:44:05,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:44:05,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-10 15:44:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:05,099 INFO L225 Difference]: With dead ends: 345 [2018-04-10 15:44:05,099 INFO L226 Difference]: Without dead ends: 345 [2018-04-10 15:44:05,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:44:05,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-04-10 15:44:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 205. [2018-04-10 15:44:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-10 15:44:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2018-04-10 15:44:05,104 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 31 [2018-04-10 15:44:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:05,104 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2018-04-10 15:44:05,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:44:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2018-04-10 15:44:05,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-10 15:44:05,105 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:05,105 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:05,105 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:05,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1748046544, now seen corresponding path program 1 times [2018-04-10 15:44:05,106 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:05,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:05,143 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-10 15:44:05,143 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:05,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:44:05,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:05,144 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-10 15:44:05,144 INFO L182 omatonBuilderFactory]: Interpolants [5770#true, 5771#false, 5772#(not (= 0 |main_#t~malloc0.base|)), 5773#(not (= 0 main_~list~0.base)), 5774#(not (= 0 main_~end~0.base))] [2018-04-10 15:44:05,144 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-10 15:44:05,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:44:05,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:44:05,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:44:05,145 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand 5 states. [2018-04-10 15:44:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:05,251 INFO L93 Difference]: Finished difference Result 230 states and 246 transitions. [2018-04-10 15:44:05,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:44:05,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-10 15:44:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:05,252 INFO L225 Difference]: With dead ends: 230 [2018-04-10 15:44:05,252 INFO L226 Difference]: Without dead ends: 230 [2018-04-10 15:44:05,253 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-10 15:44:05,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-10 15:44:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 205. [2018-04-10 15:44:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-10 15:44:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 233 transitions. [2018-04-10 15:44:05,257 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 233 transitions. Word has length 36 [2018-04-10 15:44:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:05,257 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 233 transitions. [2018-04-10 15:44:05,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:44:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 233 transitions. [2018-04-10 15:44:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 15:44:05,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:05,258 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:05,258 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1817891105, now seen corresponding path program 1 times [2018-04-10 15:44:05,260 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:05,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:05,338 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-10 15:44:05,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:05,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 15:44:05,339 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:05,339 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-10 15:44:05,339 INFO L182 omatonBuilderFactory]: Interpolants [6214#true, 6215#false, 6216#(and (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|)), 6217#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 6218#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 6219#(and (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 6220#(and (= 0 |main_#t~mem18.base|) (= 0 |main_#t~mem18.offset|)), 6221#(and (= 0 main_~inner~0.offset) (= 0 main_~inner~0.base))] [2018-04-10 15:44:05,340 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-10 15:44:05,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:44:05,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:44:05,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:44:05,340 INFO L87 Difference]: Start difference. First operand 205 states and 233 transitions. Second operand 8 states. [2018-04-10 15:44:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:05,641 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2018-04-10 15:44:05,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:44:05,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-10 15:44:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:05,643 INFO L225 Difference]: With dead ends: 315 [2018-04-10 15:44:05,643 INFO L226 Difference]: Without dead ends: 315 [2018-04-10 15:44:05,643 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:44:05,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-04-10 15:44:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 221. [2018-04-10 15:44:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-10 15:44:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 250 transitions. [2018-04-10 15:44:05,647 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 250 transitions. Word has length 42 [2018-04-10 15:44:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:05,647 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 250 transitions. [2018-04-10 15:44:05,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:44:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 250 transitions. [2018-04-10 15:44:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 15:44:05,648 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:05,648 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:05,648 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash -729312829, now seen corresponding path program 1 times [2018-04-10 15:44:05,649 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:05,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:05,719 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-10 15:44:05,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:05,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:44:05,720 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:05,720 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-10 15:44:05,720 INFO L182 omatonBuilderFactory]: Interpolants [6770#true, 6771#false, 6772#(and (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|))), 6773#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 6774#(and (= |main_#t~mem13.offset| 0) (= 8 (select |#length| |main_#t~mem13.base|)))] [2018-04-10 15:44:05,720 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-10 15:44:05,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:44:05,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:44:05,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:44:05,721 INFO L87 Difference]: Start difference. First operand 221 states and 250 transitions. Second operand 5 states. [2018-04-10 15:44:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:05,946 INFO L93 Difference]: Finished difference Result 379 states and 434 transitions. [2018-04-10 15:44:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:44:05,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-10 15:44:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:05,947 INFO L225 Difference]: With dead ends: 379 [2018-04-10 15:44:05,947 INFO L226 Difference]: Without dead ends: 379 [2018-04-10 15:44:05,948 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-10 15:44:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-10 15:44:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 220. [2018-04-10 15:44:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-10 15:44:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 249 transitions. [2018-04-10 15:44:05,950 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 249 transitions. Word has length 43 [2018-04-10 15:44:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:05,950 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 249 transitions. [2018-04-10 15:44:05,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:44:05,951 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 249 transitions. [2018-04-10 15:44:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-10 15:44:05,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:05,952 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:05,952 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -729312830, now seen corresponding path program 1 times [2018-04-10 15:44:05,953 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:05,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:05,984 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-10 15:44:05,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:05,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:44:05,985 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:44:05,985 INFO L182 omatonBuilderFactory]: Interpolants [7380#true, 7381#false, 7382#(= 1 (select |#valid| |main_#t~malloc12.base|)), 7383#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))), 7384#(= 1 (select |#valid| |main_#t~mem13.base|))] [2018-04-10 15:44:05,986 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-10 15:44:05,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:44:05,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:44:05,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:44:05,986 INFO L87 Difference]: Start difference. First operand 220 states and 249 transitions. Second operand 5 states. [2018-04-10 15:44:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:06,181 INFO L93 Difference]: Finished difference Result 343 states and 391 transitions. [2018-04-10 15:44:06,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:44:06,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-10 15:44:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:06,182 INFO L225 Difference]: With dead ends: 343 [2018-04-10 15:44:06,182 INFO L226 Difference]: Without dead ends: 343 [2018-04-10 15:44:06,183 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-10 15:44:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-10 15:44:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 219. [2018-04-10 15:44:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-10 15:44:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 248 transitions. [2018-04-10 15:44:06,189 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 248 transitions. Word has length 43 [2018-04-10 15:44:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:06,190 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 248 transitions. [2018-04-10 15:44:06,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:44:06,190 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 248 transitions. [2018-04-10 15:44:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-10 15:44:06,190 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:06,191 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:06,191 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash -345024793, now seen corresponding path program 1 times [2018-04-10 15:44:06,192 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:06,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:44:06,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:44:06,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 15:44:06,270 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:06,270 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-10 15:44:06,271 INFO L182 omatonBuilderFactory]: Interpolants [7953#true, 7954#false, 7955#(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))), 7956#(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))), 7957#(and (= 0 |main_#t~mem23.offset|) (= 0 |main_#t~mem23.base|)), 7958#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))] [2018-04-10 15:44:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:44:06,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:44:06,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:44:06,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:44:06,272 INFO L87 Difference]: Start difference. First operand 219 states and 248 transitions. Second operand 6 states. [2018-04-10 15:44:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:06,472 INFO L93 Difference]: Finished difference Result 298 states and 332 transitions. [2018-04-10 15:44:06,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:44:06,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-04-10 15:44:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:06,473 INFO L225 Difference]: With dead ends: 298 [2018-04-10 15:44:06,474 INFO L226 Difference]: Without dead ends: 298 [2018-04-10 15:44:06,474 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:44:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-10 15:44:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 256. [2018-04-10 15:44:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-04-10 15:44:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 297 transitions. [2018-04-10 15:44:06,478 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 297 transitions. Word has length 44 [2018-04-10 15:44:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:06,478 INFO L459 AbstractCegarLoop]: Abstraction has 256 states and 297 transitions. [2018-04-10 15:44:06,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:44:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 297 transitions. [2018-04-10 15:44:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 15:44:06,479 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:06,479 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:06,479 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:06,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1281162052, now seen corresponding path program 1 times [2018-04-10 15:44:06,480 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:06,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:06,559 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-10 15:44:06,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:06,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 15:44:06,559 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:06,560 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-10 15:44:06,560 INFO L182 omatonBuilderFactory]: Interpolants [8519#true, 8520#false, 8521#(= (select |#valid| main_~end~0.base) 1), 8522#(and (not (= main_~end~0.base |main_#t~malloc12.base|)) (= 1 (select |#valid| |main_#t~malloc12.base|))), 8523#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))), 8524#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (not (= main_~end~0.base |main_#t~mem13.base|))), 8525#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))), 8526#(= 1 (select |#valid| |main_#t~mem14.base|))] [2018-04-10 15:44:06,560 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-10 15:44:06,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:44:06,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:44:06,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:44:06,561 INFO L87 Difference]: Start difference. First operand 256 states and 297 transitions. Second operand 8 states. [2018-04-10 15:44:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:06,877 INFO L93 Difference]: Finished difference Result 273 states and 316 transitions. [2018-04-10 15:44:06,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:44:06,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-10 15:44:06,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:06,878 INFO L225 Difference]: With dead ends: 273 [2018-04-10 15:44:06,878 INFO L226 Difference]: Without dead ends: 273 [2018-04-10 15:44:06,878 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:44:06,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-10 15:44:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 255. [2018-04-10 15:44:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-10 15:44:06,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 296 transitions. [2018-04-10 15:44:06,881 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 296 transitions. Word has length 46 [2018-04-10 15:44:06,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:06,881 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 296 transitions. [2018-04-10 15:44:06,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:44:06,882 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 296 transitions. [2018-04-10 15:44:06,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 15:44:06,882 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:06,882 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:06,882 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:06,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1281162053, now seen corresponding path program 1 times [2018-04-10 15:44:06,883 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:06,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:06,983 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-10 15:44:06,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:06,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 15:44:06,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:06,984 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-10 15:44:06,984 INFO L182 omatonBuilderFactory]: Interpolants [9072#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 9073#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= |main_#t~mem14.offset| 0)), 9066#true, 9067#false, 9068#(= (select |#valid| main_~end~0.base) 1), 9069#(and (not (= main_~end~0.base |main_#t~malloc12.base|)) (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|))), 9070#(and (not (= main_~end~0.base (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 9071#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (not (= main_~end~0.base |main_#t~mem13.base|)) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))))] [2018-04-10 15:44:06,984 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-10 15:44:06,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:44:06,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:44:06,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:44:06,985 INFO L87 Difference]: Start difference. First operand 255 states and 296 transitions. Second operand 8 states. [2018-04-10 15:44:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:07,278 INFO L93 Difference]: Finished difference Result 272 states and 315 transitions. [2018-04-10 15:44:07,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:44:07,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-10 15:44:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:07,279 INFO L225 Difference]: With dead ends: 272 [2018-04-10 15:44:07,279 INFO L226 Difference]: Without dead ends: 272 [2018-04-10 15:44:07,280 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:44:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-10 15:44:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 254. [2018-04-10 15:44:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-10 15:44:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 295 transitions. [2018-04-10 15:44:07,284 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 295 transitions. Word has length 46 [2018-04-10 15:44:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:07,284 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 295 transitions. [2018-04-10 15:44:07,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:44:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 295 transitions. [2018-04-10 15:44:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 15:44:07,285 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:07,285 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:07,285 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:07,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1091008626, now seen corresponding path program 1 times [2018-04-10 15:44:07,286 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:07,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:07,570 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-10 15:44:07,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:07,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-10 15:44:07,570 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:44:07,571 INFO L182 omatonBuilderFactory]: Interpolants [9611#true, 9612#false, 9613#(= 0 |main_#t~malloc0.offset|), 9614#(= main_~list~0.offset 0), 9615#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 9616#(and (= 1 (select |#valid| |main_#t~malloc2.base|)) (not (= main_~list~0.base |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 9617#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 9618#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (not (= main_~list~0.base |main_#t~mem3.base|))), 9619#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 9620#(and (or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (= main_~list~0.base |main_#t~mem4.base|)) (or (= main_~list~0.offset |main_#t~mem4.offset|) (not (= main_~list~0.base |main_#t~mem4.base|)))), 9621#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 9622#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= |main_#t~mem5.base| 0) (= |main_#t~mem5.offset| 0))), 9623#(or (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not |main_#t~short7|)), 9624#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 9625#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))), 9626#(= 1 (select |#valid| |main_#t~mem18.base|)), 9627#(= 1 (select |#valid| main_~inner~0.base))] [2018-04-10 15:44:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:44:07,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 15:44:07,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 15:44:07,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:44:07,572 INFO L87 Difference]: Start difference. First operand 254 states and 295 transitions. Second operand 17 states. [2018-04-10 15:44:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:08,704 INFO L93 Difference]: Finished difference Result 563 states and 613 transitions. [2018-04-10 15:44:08,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 15:44:08,705 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-10 15:44:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:08,707 INFO L225 Difference]: With dead ends: 563 [2018-04-10 15:44:08,708 INFO L226 Difference]: Without dead ends: 563 [2018-04-10 15:44:08,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 15:44:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-04-10 15:44:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 260. [2018-04-10 15:44:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-10 15:44:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 300 transitions. [2018-04-10 15:44:08,716 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 300 transitions. Word has length 47 [2018-04-10 15:44:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:08,716 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 300 transitions. [2018-04-10 15:44:08,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 15:44:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 300 transitions. [2018-04-10 15:44:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 15:44:08,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:08,717 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:08,717 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:08,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1091008627, now seen corresponding path program 1 times [2018-04-10 15:44:08,718 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:08,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:08,988 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-10 15:44:08,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:08,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-10 15:44:08,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:08,988 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-10 15:44:08,989 INFO L182 omatonBuilderFactory]: Interpolants [10496#false, 10497#(= 0 |main_#t~malloc0.offset|), 10498#(= main_~list~0.offset 0), 10499#(and (= main_~list~0.offset 0) (= (select |#valid| main_~list~0.base) 1)), 10500#(and (not (= main_~list~0.base |main_#t~malloc2.base|)) (= 0 |main_#t~malloc2.offset|) (= 8 (select |#length| |main_#t~malloc2.base|)) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0)), 10501#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 10502#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (not (= main_~list~0.base |main_#t~mem3.base|))), 10503#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (<= 0 main_~list~0.offset) (<= main_~list~0.offset 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 10504#(and (or (= main_~list~0.base |main_#t~mem4.base|) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))) (or (= main_~list~0.offset |main_#t~mem4.offset|) (not (= main_~list~0.base |main_#t~mem4.base|)))), 10505#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))), 10506#(or (and (= |main_#t~mem5.base| 0) (= |main_#t~mem5.offset| 0)) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))), 10507#(or (not |main_#t~short7|) (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))), 10508#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 10509#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4)))), 10510#(and (= 8 (select |#length| |main_#t~mem18.base|)) (= 0 |main_#t~mem18.offset|)), 10511#(and (= 8 (select |#length| main_~inner~0.base)) (= main_~inner~0.offset 0)), 10495#true] [2018-04-10 15:44:08,989 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-10 15:44:08,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 15:44:08,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 15:44:08,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:44:08,989 INFO L87 Difference]: Start difference. First operand 260 states and 300 transitions. Second operand 17 states. [2018-04-10 15:44:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:10,364 INFO L93 Difference]: Finished difference Result 628 states and 680 transitions. [2018-04-10 15:44:10,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 15:44:10,365 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-04-10 15:44:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:10,366 INFO L225 Difference]: With dead ends: 628 [2018-04-10 15:44:10,366 INFO L226 Difference]: Without dead ends: 628 [2018-04-10 15:44:10,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=472, Invalid=1334, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 15:44:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-04-10 15:44:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 267. [2018-04-10 15:44:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-04-10 15:44:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 306 transitions. [2018-04-10 15:44:10,370 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 306 transitions. Word has length 47 [2018-04-10 15:44:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:10,370 INFO L459 AbstractCegarLoop]: Abstraction has 267 states and 306 transitions. [2018-04-10 15:44:10,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 15:44:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 306 transitions. [2018-04-10 15:44:10,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 15:44:10,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:10,371 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-10 15:44:10,371 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:10,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1441929363, now seen corresponding path program 1 times [2018-04-10 15:44:10,372 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:44:10,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:44:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 15:44:10,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:44:10,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 15:44:10,434 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:44:10,434 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-10 15:44:10,434 INFO L182 omatonBuilderFactory]: Interpolants [11459#true, 11460#false, 11461#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= |main_#t~mem5.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 11462#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))), 11463#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))), 11464#(and (= 0 |main_#t~mem24.base|) (= 0 |main_#t~mem24.offset|)), 11465#(and (= main_~end~0.offset 0) (= main_~end~0.base 0))] [2018-04-10 15:44:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 15:44:10,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:44:10,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:44:10,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:44:10,435 INFO L87 Difference]: Start difference. First operand 267 states and 306 transitions. Second operand 7 states. [2018-04-10 15:44:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:44:10,557 INFO L93 Difference]: Finished difference Result 287 states and 326 transitions. [2018-04-10 15:44:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:44:10,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-04-10 15:44:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:44:10,559 INFO L225 Difference]: With dead ends: 287 [2018-04-10 15:44:10,559 INFO L226 Difference]: Without dead ends: 287 [2018-04-10 15:44:10,559 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:44:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-10 15:44:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2018-04-10 15:44:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-04-10 15:44:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 318 transitions. [2018-04-10 15:44:10,564 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 318 transitions. Word has length 53 [2018-04-10 15:44:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:44:10,564 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 318 transitions. [2018-04-10 15:44:10,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:44:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 318 transitions. [2018-04-10 15:44:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-10 15:44:10,565 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:44:10,565 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:44:10,565 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr58AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr59AssertViolationMEMORY_FREE, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 15:44:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1874786911, now seen corresponding path program 1 times [2018-04-10 15:44:10,566 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:44:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 15:44:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 15:44:10,616 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-10 15:44:10,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 03:44:10 BoogieIcfgContainer [2018-04-10 15:44:10,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 15:44:10,646 INFO L168 Benchmark]: Toolchain (without parser) took 10337.66 ms. Allocated memory was 389.0 MB in the beginning and 826.8 MB in the end (delta: 437.8 MB). Free memory was 322.5 MB in the beginning and 754.7 MB in the end (delta: -432.3 MB). Peak memory consumption was 5.5 MB. Max. memory is 5.3 GB. [2018-04-10 15:44:10,647 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 389.0 MB. Free memory is still 350.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 15:44:10,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.71 ms. Allocated memory is still 389.0 MB. Free memory was 322.5 MB in the beginning and 296.0 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-10 15:44:10,648 INFO L168 Benchmark]: Boogie Preprocessor took 43.15 ms. Allocated memory is still 389.0 MB. Free memory was 296.0 MB in the beginning and 292.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-10 15:44:10,648 INFO L168 Benchmark]: RCFGBuilder took 692.90 ms. Allocated memory was 389.0 MB in the beginning and 586.2 MB in the end (delta: 197.1 MB). Free memory was 292.1 MB in the beginning and 494.0 MB in the end (delta: -202.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-10 15:44:10,648 INFO L168 Benchmark]: TraceAbstraction took 9318.34 ms. Allocated memory was 586.2 MB in the beginning and 826.8 MB in the end (delta: 240.6 MB). Free memory was 494.0 MB in the beginning and 754.7 MB in the end (delta: -260.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 15:44:10,650 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.14 ms. Allocated memory is still 389.0 MB. Free memory is still 350.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 279.71 ms. Allocated memory is still 389.0 MB. Free memory was 322.5 MB in the beginning and 296.0 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.15 ms. Allocated memory is still 389.0 MB. Free memory was 296.0 MB in the beginning and 292.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 692.90 ms. Allocated memory was 389.0 MB in the beginning and 586.2 MB in the end (delta: 197.1 MB). Free memory was 292.1 MB in the beginning and 494.0 MB in the end (delta: -202.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9318.34 ms. Allocated memory was 586.2 MB in the beginning and 826.8 MB in the end (delta: 240.6 MB). Free memory was 494.0 MB in the beginning and 754.7 MB in the end (delta: -260.7 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1029]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L992] FCALL list->next = ((void*)0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={9:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] COND TRUE, EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={9:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L995] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(0) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={11:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->inner VAL [end={11:0}, end->inner={9:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={11:0}, inner={9:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1025] EXPR, FCALL inner->inner VAL [end={11:0}, inner={9:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1026] EXPR, FCALL inner->next VAL [end={11:0}, inner={9:0}, inner->next={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1027] EXPR, FCALL inner->inner VAL [end={11:0}, inner={9:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1029] FCALL inner->inner - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 192 locations, 65 error locations. UNSAFE Result, 9.2s OverallTime, 22 OverallIterations, 2 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3577 SDtfs, 7297 SDslu, 11250 SDs, 0 SdLazy, 8232 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 3/5 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, 21 MinimizatonAttempts, 2183 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 738 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 177154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 3/5 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/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_15-44-10-656.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_15-44-10-656.csv Received shutdown request...