java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-12 02:09:18,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 02:09:18,221 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 02:09:18,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 02:09:18,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 02:09:18,235 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 02:09:18,236 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 02:09:18,237 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 02:09:18,239 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 02:09:18,239 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 02:09:18,240 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 02:09:18,240 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 02:09:18,241 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 02:09:18,242 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 02:09:18,243 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 02:09:18,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 02:09:18,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 02:09:18,247 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 02:09:18,248 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 02:09:18,249 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 02:09:18,250 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 02:09:18,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 02:09:18,251 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 02:09:18,252 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 02:09:18,252 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 02:09:18,253 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 02:09:18,253 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 02:09:18,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 02:09:18,254 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 02:09:18,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 02:09:18,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 02:09:18,255 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-12 02:09:18,276 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 02:09:18,276 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 02:09:18,277 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 02:09:18,277 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 02:09:18,277 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 02:09:18,278 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 02:09:18,278 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 02:09:18,278 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 02:09:18,278 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 02:09:18,278 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 02:09:18,278 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 02:09:18,278 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 02:09:18,278 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 02:09:18,279 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 02:09:18,279 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 02:09:18,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 02:09:18,279 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 02:09:18,279 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 02:09:18,279 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 02:09:18,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 02:09:18,279 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 02:09:18,279 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 02:09:18,280 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 02:09:18,280 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 02:09:18,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 02:09:18,320 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 02:09:18,322 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 02:09:18,323 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 02:09:18,324 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 02:09:18,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,602 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3fbf1b5d2 [2018-04-12 02:09:18,741 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 02:09:18,741 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 02:09:18,741 INFO L168 CDTParser]: Scanning sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,748 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 02:09:18,749 INFO L215 ultiparseSymbolTable]: [2018-04-12 02:09:18,749 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 02:09:18,749 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,749 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 02:09:18,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____dev_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_ulong_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____qaddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____id_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____off64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_char in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_set in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__uid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__lldiv_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____caddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__mode_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____suseconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____pthread_slist_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____timer_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsblkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blksize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____off_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsfilcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ssize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____time_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ldiv_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ushort in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_slong_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_mask in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____nlink_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ino_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutex_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__idtype_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__register_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__time_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__Colour in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__dev_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__sigset_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__id_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__loff_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fd_mask in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__nlink_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__uint in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_int in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ssize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsword_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____sig_atomic_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_attr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__wchar_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____useconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____daddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__clockid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____clock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__timer_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____loff_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_condattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____pid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____gid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____mode_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_long in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__daddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____intptr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__size_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__gid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__clock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrier_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____socklen_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__suseconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_short in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__blkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ulong in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____clockid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_long in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__div_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__caddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_cond_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__SLL in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_short in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_char in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__off_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____sigset_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_once_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__blksize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_spinlock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:18,771 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG3fbf1b5d2 [2018-04-12 02:09:18,774 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 02:09:18,775 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 02:09:18,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 02:09:18,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 02:09:18,781 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 02:09:18,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 02:09:18" (1/1) ... [2018-04-12 02:09:18,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@449402f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:18, skipping insertion in model container [2018-04-12 02:09:18,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 02:09:18" (1/1) ... [2018-04-12 02:09:18,794 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 02:09:18,819 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 02:09:18,943 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 02:09:18,984 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 02:09:18,990 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-12 02:09:19,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:19 WrapperNode [2018-04-12 02:09:19,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 02:09:19,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 02:09:19,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 02:09:19,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 02:09:19,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:19" (1/1) ... [2018-04-12 02:09:19,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:19" (1/1) ... [2018-04-12 02:09:19,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:19" (1/1) ... [2018-04-12 02:09:19,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:19" (1/1) ... [2018-04-12 02:09:19,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:19" (1/1) ... [2018-04-12 02:09:19,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:19" (1/1) ... [2018-04-12 02:09:19,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:19" (1/1) ... [2018-04-12 02:09:19,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 02:09:19,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 02:09:19,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 02:09:19,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 02:09:19,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:19" (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-12 02:09:19,116 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 02:09:19,117 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 02:09:19,117 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 02:09:19,117 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 02:09:19,117 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 02:09:19,117 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 02:09:19,117 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 02:09:19,117 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 02:09:19,117 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 02:09:19,117 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 02:09:19,117 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 02:09:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 02:09:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 02:09:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 02:09:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 02:09:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 02:09:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 02:09:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 02:09:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 02:09:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 02:09:19,118 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 02:09:19,119 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 02:09:19,120 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 02:09:19,120 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 02:09:19,120 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 02:09:19,120 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 02:09:19,120 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 02:09:19,120 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 02:09:19,120 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 02:09:19,120 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 02:09:19,121 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 02:09:19,121 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 02:09:19,121 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 02:09:19,121 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 02:09:19,121 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 02:09:19,121 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 02:09:19,121 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 02:09:19,121 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 02:09:19,121 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 02:09:19,121 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 02:09:19,122 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 02:09:19,122 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 02:09:19,122 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 02:09:19,122 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 02:09:19,122 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 02:09:19,122 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 02:09:19,122 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 02:09:19,122 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 02:09:19,122 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 02:09:19,122 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 02:09:19,123 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 02:09:19,123 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 02:09:19,123 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 02:09:19,123 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 02:09:19,123 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 02:09:19,123 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 02:09:19,123 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 02:09:19,123 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 02:09:19,123 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 02:09:19,123 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 02:09:19,124 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 02:09:19,125 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 02:09:19,126 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 02:09:19,126 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 02:09:19,126 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 02:09:19,126 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 02:09:19,126 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 02:09:19,126 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 02:09:19,126 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 02:09:19,126 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 02:09:19,126 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 02:09:19,126 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 02:09:19,127 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 02:09:19,127 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 02:09:19,127 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 02:09:19,127 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 02:09:19,127 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 02:09:19,127 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 02:09:19,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 02:09:19,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 02:09:19,127 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 02:09:19,128 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 02:09:19,545 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 02:09:19,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 02:09:19 BoogieIcfgContainer [2018-04-12 02:09:19,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 02:09:19,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 02:09:19,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 02:09:19,548 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 02:09:19,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 02:09:18" (1/3) ... [2018-04-12 02:09:19,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3692c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 02:09:19, skipping insertion in model container [2018-04-12 02:09:19,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:09:19" (2/3) ... [2018-04-12 02:09:19,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e3692c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 02:09:19, skipping insertion in model container [2018-04-12 02:09:19,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 02:09:19" (3/3) ... [2018-04-12 02:09:19,551 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:09:19,556 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 02:09:19,563 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-04-12 02:09:19,587 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 02:09:19,588 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 02:09:19,588 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 02:09:19,588 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 02:09:19,588 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 02:09:19,588 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 02:09:19,589 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 02:09:19,589 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 02:09:19,589 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 02:09:19,589 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 02:09:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-04-12 02:09:19,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 02:09:19,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:19,608 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:19,608 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:19,611 INFO L82 PathProgramCache]: Analyzing trace with hash -659694479, now seen corresponding path program 1 times [2018-04-12 02:09:19,612 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:19,612 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:19,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:19,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:19,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:19,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:19,723 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-12 02:09:19,725 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:19,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 02:09:19,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 02:09:19,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 02:09:19,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 02:09:19,738 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 4 states. [2018-04-12 02:09:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:19,907 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-04-12 02:09:19,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:09:19,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 02:09:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:19,918 INFO L225 Difference]: With dead ends: 141 [2018-04-12 02:09:19,918 INFO L226 Difference]: Without dead ends: 137 [2018-04-12 02:09:19,920 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-12 02:09:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-12 02:09:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-04-12 02:09:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-12 02:09:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-12 02:09:19,951 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 8 [2018-04-12 02:09:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:19,951 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-12 02:09:19,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 02:09:19,952 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-12 02:09:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 02:09:19,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:19,952 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:19,952 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash -659694478, now seen corresponding path program 1 times [2018-04-12 02:09:19,952 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:19,952 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:19,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:19,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:19,954 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:19,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:20,000 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-12 02:09:20,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:20,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 02:09:20,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 02:09:20,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 02:09:20,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 02:09:20,002 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 4 states. [2018-04-12 02:09:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:20,097 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-04-12 02:09:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 02:09:20,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 02:09:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:20,098 INFO L225 Difference]: With dead ends: 135 [2018-04-12 02:09:20,099 INFO L226 Difference]: Without dead ends: 135 [2018-04-12 02:09:20,099 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-12 02:09:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-12 02:09:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-04-12 02:09:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-12 02:09:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-12 02:09:20,107 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 8 [2018-04-12 02:09:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:20,107 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-12 02:09:20,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 02:09:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-12 02:09:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-12 02:09:20,108 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:20,108 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:20,108 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash -202425566, now seen corresponding path program 1 times [2018-04-12 02:09:20,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:20,108 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:20,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:20,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:20,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:20,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:20,166 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-12 02:09:20,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:20,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 02:09:20,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 02:09:20,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 02:09:20,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 02:09:20,167 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 4 states. [2018-04-12 02:09:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:20,309 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-04-12 02:09:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:09:20,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-12 02:09:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:20,310 INFO L225 Difference]: With dead ends: 133 [2018-04-12 02:09:20,310 INFO L226 Difference]: Without dead ends: 133 [2018-04-12 02:09:20,311 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-12 02:09:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-12 02:09:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2018-04-12 02:09:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-12 02:09:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-04-12 02:09:20,316 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 15 [2018-04-12 02:09:20,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:20,316 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-04-12 02:09:20,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 02:09:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-04-12 02:09:20,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-12 02:09:20,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:20,317 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:20,317 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash -202425565, now seen corresponding path program 1 times [2018-04-12 02:09:20,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:20,317 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:20,319 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:20,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:20,319 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:20,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:20,377 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-12 02:09:20,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:20,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 02:09:20,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:09:20,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:09:20,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:09:20,378 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 5 states. [2018-04-12 02:09:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:20,517 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-04-12 02:09:20,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:09:20,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-12 02:09:20,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:20,518 INFO L225 Difference]: With dead ends: 156 [2018-04-12 02:09:20,518 INFO L226 Difference]: Without dead ends: 156 [2018-04-12 02:09:20,518 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-12 02:09:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-12 02:09:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 129. [2018-04-12 02:09:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-12 02:09:20,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-04-12 02:09:20,523 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 15 [2018-04-12 02:09:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:20,523 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-04-12 02:09:20,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:09:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-04-12 02:09:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 02:09:20,524 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:20,524 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:20,524 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:20,524 INFO L82 PathProgramCache]: Analyzing trace with hash -325956996, now seen corresponding path program 1 times [2018-04-12 02:09:20,524 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:20,524 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:20,525 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:20,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:20,525 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:20,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:20,588 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-12 02:09:20,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:20,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 02:09:20,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 02:09:20,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 02:09:20,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 02:09:20,589 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 6 states. [2018-04-12 02:09:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:20,804 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-12 02:09:20,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-12 02:09:20,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-12 02:09:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:20,805 INFO L225 Difference]: With dead ends: 216 [2018-04-12 02:09:20,805 INFO L226 Difference]: Without dead ends: 216 [2018-04-12 02:09:20,805 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-12 02:09:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-12 02:09:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 124. [2018-04-12 02:09:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-12 02:09:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-04-12 02:09:20,809 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 18 [2018-04-12 02:09:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:20,809 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-04-12 02:09:20,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 02:09:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-04-12 02:09:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 02:09:20,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:20,810 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:20,811 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:20,811 INFO L82 PathProgramCache]: Analyzing trace with hash -325956997, now seen corresponding path program 1 times [2018-04-12 02:09:20,811 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:20,811 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:20,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:20,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:20,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:20,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:20,857 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-12 02:09:20,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:20,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 02:09:20,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 02:09:20,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 02:09:20,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 02:09:20,858 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 6 states. [2018-04-12 02:09:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:21,007 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2018-04-12 02:09:21,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 02:09:21,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-12 02:09:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:21,008 INFO L225 Difference]: With dead ends: 211 [2018-04-12 02:09:21,008 INFO L226 Difference]: Without dead ends: 211 [2018-04-12 02:09:21,009 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-12 02:09:21,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-12 02:09:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2018-04-12 02:09:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-12 02:09:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-04-12 02:09:21,013 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2018-04-12 02:09:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:21,014 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-04-12 02:09:21,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 02:09:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-04-12 02:09:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 02:09:21,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:21,015 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:21,015 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash -765015574, now seen corresponding path program 1 times [2018-04-12 02:09:21,015 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:21,015 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:21,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:21,017 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:21,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:21,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:21,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 02:09:21,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 02:09:21,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 02:09:21,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 02:09:21,061 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-04-12 02:09:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:21,217 INFO L93 Difference]: Finished difference Result 224 states and 244 transitions. [2018-04-12 02:09:21,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 02:09:21,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-12 02:09:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:21,218 INFO L225 Difference]: With dead ends: 224 [2018-04-12 02:09:21,218 INFO L226 Difference]: Without dead ends: 224 [2018-04-12 02:09:21,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-12 02:09:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-12 02:09:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 122. [2018-04-12 02:09:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-12 02:09:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-04-12 02:09:21,222 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 26 [2018-04-12 02:09:21,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:21,222 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-04-12 02:09:21,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 02:09:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-04-12 02:09:21,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-12 02:09:21,223 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:21,223 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-12 02:09:21,223 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:21,224 INFO L82 PathProgramCache]: Analyzing trace with hash -765015573, now seen corresponding path program 1 times [2018-04-12 02:09:21,224 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:21,224 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:21,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:21,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:21,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:21,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-12 02:09:21,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:21,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 02:09:21,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 02:09:21,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 02:09:21,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 02:09:21,288 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2018-04-12 02:09:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:21,473 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2018-04-12 02:09:21,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 02:09:21,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-12 02:09:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:21,474 INFO L225 Difference]: With dead ends: 217 [2018-04-12 02:09:21,474 INFO L226 Difference]: Without dead ends: 217 [2018-04-12 02:09:21,475 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-12 02:09:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-12 02:09:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 112. [2018-04-12 02:09:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-12 02:09:21,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-04-12 02:09:21,477 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 26 [2018-04-12 02:09:21,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:21,477 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-04-12 02:09:21,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 02:09:21,477 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-04-12 02:09:21,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-12 02:09:21,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:21,477 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] [2018-04-12 02:09:21,478 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1849046283, now seen corresponding path program 1 times [2018-04-12 02:09:21,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:21,478 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:21,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:21,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:21,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:21,514 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-12 02:09:21,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:21,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 02:09:21,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:09:21,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:09:21,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:09:21,515 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 5 states. [2018-04-12 02:09:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:21,593 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-04-12 02:09:21,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:09:21,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-12 02:09:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:21,594 INFO L225 Difference]: With dead ends: 131 [2018-04-12 02:09:21,594 INFO L226 Difference]: Without dead ends: 131 [2018-04-12 02:09:21,594 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-12 02:09:21,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-12 02:09:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2018-04-12 02:09:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-12 02:09:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-04-12 02:09:21,597 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 27 [2018-04-12 02:09:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:21,597 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-04-12 02:09:21,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:09:21,597 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-04-12 02:09:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 02:09:21,598 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:21,598 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-12 02:09:21,598 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:21,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1472510335, now seen corresponding path program 1 times [2018-04-12 02:09:21,598 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:21,598 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:21,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:21,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:21,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:21,662 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-12 02:09:21,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:21,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 02:09:21,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:09:21,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:09:21,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:09:21,664 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 5 states. [2018-04-12 02:09:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:21,756 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-04-12 02:09:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:09:21,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-12 02:09:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:21,757 INFO L225 Difference]: With dead ends: 120 [2018-04-12 02:09:21,757 INFO L226 Difference]: Without dead ends: 120 [2018-04-12 02:09:21,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 02:09:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-12 02:09:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2018-04-12 02:09:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-12 02:09:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-04-12 02:09:21,761 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 28 [2018-04-12 02:09:21,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:21,761 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-04-12 02:09:21,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:09:21,761 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-04-12 02:09:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-12 02:09:21,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:21,762 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] [2018-04-12 02:09:21,762 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1101576030, now seen corresponding path program 1 times [2018-04-12 02:09:21,762 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:21,762 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:21,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:21,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:21,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:21,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:21,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 02:09:21,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:09:21,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:09:21,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:09:21,827 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 5 states. [2018-04-12 02:09:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:21,933 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-04-12 02:09:21,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 02:09:21,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-04-12 02:09:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:21,934 INFO L225 Difference]: With dead ends: 131 [2018-04-12 02:09:21,934 INFO L226 Difference]: Without dead ends: 116 [2018-04-12 02:09:21,935 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-12 02:09:21,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-12 02:09:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-04-12 02:09:21,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-12 02:09:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-04-12 02:09:21,939 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 34 [2018-04-12 02:09:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:21,939 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-04-12 02:09:21,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:09:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-04-12 02:09:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-12 02:09:21,940 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:21,940 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:21,940 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:21,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738935, now seen corresponding path program 1 times [2018-04-12 02:09:21,941 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:21,941 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:21,942 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:21,942 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:21,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:22,087 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:09:22,087 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:09:22,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:22,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:09:22,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:22,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:22,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 02:09:22,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:22,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:22,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 02:09:22,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:22,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:22,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:22,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:22,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:22,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 02:09:22,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-12 02:09:22,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 02:09:22,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:22,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:22,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:22,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-12 02:09:22,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-12 02:09:22,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 02:09:22,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:22,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:22,401 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:22,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:22,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:22,408 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-12 02:09:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:22,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:22,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-04-12 02:09:22,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-12 02:09:22,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-12 02:09:22,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-04-12 02:09:22,483 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 21 states. [2018-04-12 02:09:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:22,995 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-04-12 02:09:22,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-12 02:09:22,996 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-04-12 02:09:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:22,997 INFO L225 Difference]: With dead ends: 212 [2018-04-12 02:09:22,997 INFO L226 Difference]: Without dead ends: 212 [2018-04-12 02:09:22,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-04-12 02:09:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-12 02:09:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 146. [2018-04-12 02:09:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-12 02:09:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-04-12 02:09:23,002 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 45 [2018-04-12 02:09:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:23,002 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-04-12 02:09:23,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-12 02:09:23,002 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-04-12 02:09:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-12 02:09:23,003 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:23,003 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:23,003 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:23,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738936, now seen corresponding path program 1 times [2018-04-12 02:09:23,004 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:23,004 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:23,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:23,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:23,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:23,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:23,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:09:23,172 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:09:23,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:23,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:09:23,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:23,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:23,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:09:23,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 02:09:23,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 02:09:23,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:23,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:23,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:23,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:23,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,277 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 02:09:23,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-12 02:09:23,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 02:09:23,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 02:09:23,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 02:09:23,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:23,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-12 02:09:23,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-12 02:09:23,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-12 02:09:23,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:23,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-12 02:09:23,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 02:09:23,444 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:23,448 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:23,454 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-12 02:09:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:23,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:23,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-04-12 02:09:23,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-12 02:09:23,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-12 02:09:23,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-12 02:09:23,501 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 17 states. [2018-04-12 02:09:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:24,139 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2018-04-12 02:09:24,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 02:09:24,139 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-04-12 02:09:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:24,140 INFO L225 Difference]: With dead ends: 218 [2018-04-12 02:09:24,140 INFO L226 Difference]: Without dead ends: 218 [2018-04-12 02:09:24,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-04-12 02:09:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-12 02:09:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-04-12 02:09:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-12 02:09:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-04-12 02:09:24,145 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 45 [2018-04-12 02:09:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:24,145 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-04-12 02:09:24,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-12 02:09:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-04-12 02:09:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 02:09:24,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:24,146 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:24,146 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1481333305, now seen corresponding path program 1 times [2018-04-12 02:09:24,147 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:24,147 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:24,148 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:24,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:24,148 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:24,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:24,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:09:24,686 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:09:24,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:24,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:09:24,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 02:09:24,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:24,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:24,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:09:24,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 02:09:24,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:24,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:24,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:24,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:24,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,815 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 02:09:24,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:24,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 02:09:24,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 02:09:24,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:24,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-12 02:09:24,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:24,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:24,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-04-12 02:09:24,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-04-12 02:09:24,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:25,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-12 02:09:25,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:09:25,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:25,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:25,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:25,022 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-04-12 02:09:25,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-12 02:09:25,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:25,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:25,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-04-12 02:09:25,176 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:25,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:25,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-12 02:09:25,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 02:09:25,193 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:25,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:25,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:25,200 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:25,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:25,206 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-04-12 02:09:25,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-12 02:09:25,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 02:09:25,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:09:25,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:09:25,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:09:25,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-12 02:09:25,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:25,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:25,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2018-04-12 02:09:25,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-12 02:09:25,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-12 02:09:25,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=962, Unknown=1, NotChecked=0, Total=1056 [2018-04-12 02:09:25,365 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 33 states. [2018-04-12 02:09:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:26,894 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-04-12 02:09:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 02:09:26,894 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-04-12 02:09:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:26,895 INFO L225 Difference]: With dead ends: 214 [2018-04-12 02:09:26,895 INFO L226 Difference]: Without dead ends: 214 [2018-04-12 02:09:26,896 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=344, Invalid=2104, Unknown=2, NotChecked=0, Total=2450 [2018-04-12 02:09:26,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-12 02:09:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 145. [2018-04-12 02:09:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-12 02:09:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-04-12 02:09:26,899 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 49 [2018-04-12 02:09:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:26,900 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-04-12 02:09:26,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-12 02:09:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-04-12 02:09:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 02:09:26,900 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:26,901 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:26,901 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:26,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438270, now seen corresponding path program 1 times [2018-04-12 02:09:26,901 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:26,901 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:26,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:26,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:26,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:26,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:27,110 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:09:27,110 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:09:27,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:27,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:09:27,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:27,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:27,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:09:27,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-12 02:09:27,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:27,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:27,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-12 02:09:27,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-12 02:09:27,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:27,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-12 02:09:27,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:27,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:27,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:09:27,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-04-12 02:09:27,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-12 02:09:27,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-12 02:09:27,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-04-12 02:09:27,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 61 [2018-04-12 02:09:27,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-12 02:09:27,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 48 [2018-04-12 02:09:27,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 02:09:27,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:09:27,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 02:09:27,393 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:75 [2018-04-12 02:09:27,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2018-04-12 02:09:27,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-04-12 02:09:27,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-04-12 02:09:27,548 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2018-04-12 02:09:27,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 02:09:27,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-12 02:09:27,589 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 02:09:27,607 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-12 02:09:27,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 02:09:27,619 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:27,623 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,625 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:27,630 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:89, output treesize:5 [2018-04-12 02:09:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:27,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:27,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2018-04-12 02:09:27,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-12 02:09:27,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-12 02:09:27,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-04-12 02:09:27,662 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 23 states. [2018-04-12 02:09:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:28,452 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-04-12 02:09:28,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-12 02:09:28,453 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-04-12 02:09:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:28,453 INFO L225 Difference]: With dead ends: 247 [2018-04-12 02:09:28,454 INFO L226 Difference]: Without dead ends: 247 [2018-04-12 02:09:28,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2018-04-12 02:09:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-12 02:09:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 176. [2018-04-12 02:09:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-12 02:09:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-04-12 02:09:28,457 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 51 [2018-04-12 02:09:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:28,458 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-04-12 02:09:28,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-12 02:09:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-04-12 02:09:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-12 02:09:28,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:28,458 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:28,458 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:28,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438271, now seen corresponding path program 1 times [2018-04-12 02:09:28,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:28,458 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:28,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:28,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:28,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:28,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:28,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:09:28,683 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:09:28,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:28,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:09:28,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:28,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:28,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 02:09:28,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 02:09:28,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:28,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:28,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:28,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:28,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 02:09:28,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:28,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 02:09:28,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:28,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:28,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 02:09:28,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 02:09:28,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-12 02:09:28,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:28,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-12 02:09:28,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:28,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:28,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:28,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 02:09:28,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-04-12 02:09:28,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:28,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-04-12 02:09:28,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-12 02:09:28,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-04-12 02:09:28,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-12 02:09:28,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:28,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:66 [2018-04-12 02:09:29,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2018-04-12 02:09:29,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 02:09:29,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:29,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:29,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-12 02:09:29,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 02:09:29,102 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:29,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:29,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:29,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:101 [2018-04-12 02:09:29,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-04-12 02:09:29,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:29,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:29,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-12 02:09:29,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:29,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-12 02:09:29,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:29,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:29,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-12 02:09:29,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:29,264 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:29,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 02:09:29,270 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:29,272 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:29,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:29,281 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-04-12 02:09:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:29,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:29,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-04-12 02:09:29,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 02:09:29,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 02:09:29,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-04-12 02:09:29,394 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 31 states. [2018-04-12 02:09:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:31,184 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2018-04-12 02:09:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 02:09:31,184 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-04-12 02:09:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:31,186 INFO L225 Difference]: With dead ends: 305 [2018-04-12 02:09:31,187 INFO L226 Difference]: Without dead ends: 305 [2018-04-12 02:09:31,187 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=366, Invalid=2390, Unknown=0, NotChecked=0, Total=2756 [2018-04-12 02:09:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-12 02:09:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 178. [2018-04-12 02:09:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-12 02:09:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-04-12 02:09:31,190 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 51 [2018-04-12 02:09:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:31,190 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-04-12 02:09:31,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 02:09:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-04-12 02:09:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-12 02:09:31,191 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:31,191 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:31,191 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:31,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1776041815, now seen corresponding path program 1 times [2018-04-12 02:09:31,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:31,191 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:31,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:31,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:31,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:31,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:31,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 02:09:31,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:09:31,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 02:09:31,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 02:09:31,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 02:09:31,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 02:09:31,226 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 6 states. [2018-04-12 02:09:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:31,304 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-04-12 02:09:31,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 02:09:31,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-04-12 02:09:31,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:31,305 INFO L225 Difference]: With dead ends: 142 [2018-04-12 02:09:31,305 INFO L226 Difference]: Without dead ends: 142 [2018-04-12 02:09:31,305 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-12 02:09:31,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-12 02:09:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2018-04-12 02:09:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 02:09:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-04-12 02:09:31,307 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 54 [2018-04-12 02:09:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:31,308 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-04-12 02:09:31,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 02:09:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-04-12 02:09:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-12 02:09:31,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:31,308 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:31,309 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:31,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1044886106, now seen corresponding path program 2 times [2018-04-12 02:09:31,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:31,309 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:31,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:31,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:31,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:31,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:31,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:09:31,468 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:09:31,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 02:09:31,492 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 02:09:31,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 02:09:31,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:09:31,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:31,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:31,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:09:31,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 02:09:31,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:31,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:31,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:31,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:31,620 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,628 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:18 [2018-04-12 02:09:31,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-12 02:09:31,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 02:09:31,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-12 02:09:31,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 02:09:31,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2018-04-12 02:09:31,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:31,848 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:31,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-04-12 02:09:31,852 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:31,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2018-04-12 02:09:31,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:31,860 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:31,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-12 02:09:31,860 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:31,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-12 02:09:31,873 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:31,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-12 02:09:31,874 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:31,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 02:09:31,877 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,878 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:31,882 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-04-12 02:09:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:31,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:31,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 [2018-04-12 02:09:31,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-12 02:09:31,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-12 02:09:31,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=577, Unknown=3, NotChecked=0, Total=650 [2018-04-12 02:09:31,919 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 26 states. [2018-04-12 02:09:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:32,411 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-04-12 02:09:32,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-12 02:09:32,411 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-04-12 02:09:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:32,412 INFO L225 Difference]: With dead ends: 151 [2018-04-12 02:09:32,412 INFO L226 Difference]: Without dead ends: 126 [2018-04-12 02:09:32,412 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=1237, Unknown=3, NotChecked=0, Total=1482 [2018-04-12 02:09:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-12 02:09:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-04-12 02:09:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-12 02:09:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-04-12 02:09:32,414 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 55 [2018-04-12 02:09:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:32,414 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-04-12 02:09:32,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-12 02:09:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-04-12 02:09:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-12 02:09:32,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:32,414 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:32,415 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:32,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070912, now seen corresponding path program 1 times [2018-04-12 02:09:32,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:32,415 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:32,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:32,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 02:09:32,416 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:32,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:32,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:32,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:09:32,652 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:09:32,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:32,679 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:09:32,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:32,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:32,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 02:09:32,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-12 02:09:32,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:32,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:32,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:32,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:32,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,728 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-12 02:09:32,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:32,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-04-12 02:09:32,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 02:09:32,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:32,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-04-12 02:09:32,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-12 02:09:32,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-04-12 02:09:32,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:32,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:32,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:32,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-12 02:09:32,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2018-04-12 02:09:32,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-04-12 02:09:32,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-04-12 02:09:32,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:32,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-04-12 02:09:32,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-04-12 02:09:32,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:32,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2018-04-12 02:09:33,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 112 [2018-04-12 02:09:33,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-12 02:09:33,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:33,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:33,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 103 [2018-04-12 02:09:33,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-12 02:09:33,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:33,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:33,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:33,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:153, output treesize:121 [2018-04-12 02:09:33,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-04-12 02:09:33,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:33,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:33,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2018-04-12 02:09:33,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:33,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:33,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:33,280 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-04-12 02:09:33,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-04-12 02:09:33,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:33,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:33,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-12 02:09:33,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:33,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-12 02:09:33,370 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:33,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:33,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:33,378 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-04-12 02:09:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:33,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:33,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-04-12 02:09:33,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-12 02:09:33,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-12 02:09:33,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2018-04-12 02:09:33,468 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 35 states. [2018-04-12 02:09:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:34,370 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-04-12 02:09:34,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 02:09:34,370 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 55 [2018-04-12 02:09:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:34,371 INFO L225 Difference]: With dead ends: 161 [2018-04-12 02:09:34,371 INFO L226 Difference]: Without dead ends: 161 [2018-04-12 02:09:34,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=326, Invalid=2026, Unknown=0, NotChecked=0, Total=2352 [2018-04-12 02:09:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-12 02:09:34,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2018-04-12 02:09:34,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-12 02:09:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-04-12 02:09:34,373 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 55 [2018-04-12 02:09:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:34,373 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-04-12 02:09:34,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-12 02:09:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-04-12 02:09:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-12 02:09:34,374 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:34,374 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:34,374 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:34,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070911, now seen corresponding path program 1 times [2018-04-12 02:09:34,374 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:34,374 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:34,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:34,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:34,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:34,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:34,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:09:34,627 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:09:34,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:34,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:09:34,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:34,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:34,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 02:09:34,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 02:09:34,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:34,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:34,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:34,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:34,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-12 02:09:34,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-12 02:09:34,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-12 02:09:34,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-04-12 02:09:34,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-12 02:09:34,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,798 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:55 [2018-04-12 02:09:34,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:34,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:34,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:34,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 02:09:34,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 02:09:34,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-04-12 02:09:34,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-12 02:09:34,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-12 02:09:34,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:34,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2018-04-12 02:09:34,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-12 02:09:34,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:34,923 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:71 [2018-04-12 02:09:35,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 118 [2018-04-12 02:09:35,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-12 02:09:35,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:35,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:35,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 119 [2018-04-12 02:09:35,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-12 02:09:35,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:35,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:35,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:35,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:115 [2018-04-12 02:09:35,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-04-12 02:09:35,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-12 02:09:35,249 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:35,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 21 [2018-04-12 02:09:35,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:35,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:35,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:35,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:35,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-04-12 02:09:35,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 02:09:35,289 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:35,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 02:09:35,296 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:35,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:35,299 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:35,300 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:35,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:35,305 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-04-12 02:09:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:35,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:35,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2018-04-12 02:09:35,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 02:09:35,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 02:09:35,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2018-04-12 02:09:35,357 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 31 states. [2018-04-12 02:09:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:36,301 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-04-12 02:09:36,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 02:09:36,301 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 55 [2018-04-12 02:09:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:36,301 INFO L225 Difference]: With dead ends: 159 [2018-04-12 02:09:36,301 INFO L226 Difference]: Without dead ends: 159 [2018-04-12 02:09:36,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=224, Invalid=1756, Unknown=0, NotChecked=0, Total=1980 [2018-04-12 02:09:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-12 02:09:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-04-12 02:09:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-12 02:09:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-12 02:09:36,303 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 55 [2018-04-12 02:09:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:36,303 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-12 02:09:36,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 02:09:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-12 02:09:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 02:09:36,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:36,304 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:36,304 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:36,304 INFO L82 PathProgramCache]: Analyzing trace with hash -817344126, now seen corresponding path program 3 times [2018-04-12 02:09:36,304 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:36,304 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:36,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:36,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:09:36,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:36,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:36,451 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:09:36,485 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:09:36,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 02:09:36,507 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-12 02:09:36,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 02:09:36,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:09:36,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 02:09:36,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-12 02:09:36,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:36,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:36,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:09:36,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 02:09:36,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:36,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:36,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-12 02:09:36,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:36,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-12 02:09:36,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:36,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-12 02:09:36,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:36,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:36,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:09:36,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-04-12 02:09:36,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:36,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-12 02:09:36,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-12 02:09:36,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2018-04-12 02:09:36,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 61 [2018-04-12 02:09:36,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-12 02:09:36,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 48 [2018-04-12 02:09:36,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-12 02:09:36,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:09:36,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 02:09:36,800 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:81 [2018-04-12 02:09:36,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2018-04-12 02:09:36,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2018-04-12 02:09:36,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:09:36,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-12 02:09:36,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-04-12 02:09:36,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-04-12 02:09:36,983 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-04-12 02:09:36,984 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:36,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-04-12 02:09:36,998 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:37,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:37,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-04-12 02:09:37,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:37,015 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:37,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 02:09:37,020 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:37,022 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:37,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:37,029 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-04-12 02:09:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:37,064 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:37,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2018-04-12 02:09:37,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-12 02:09:37,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-12 02:09:37,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-04-12 02:09:37,065 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 31 states. [2018-04-12 02:09:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:38,231 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-04-12 02:09:38,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-12 02:09:38,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-04-12 02:09:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:38,232 INFO L225 Difference]: With dead ends: 194 [2018-04-12 02:09:38,232 INFO L226 Difference]: Without dead ends: 194 [2018-04-12 02:09:38,233 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=409, Invalid=2243, Unknown=0, NotChecked=0, Total=2652 [2018-04-12 02:09:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-12 02:09:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-04-12 02:09:38,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-12 02:09:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-04-12 02:09:38,235 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 56 [2018-04-12 02:09:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:38,235 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-04-12 02:09:38,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-12 02:09:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-04-12 02:09:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-12 02:09:38,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:38,236 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:38,236 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:38,237 INFO L82 PathProgramCache]: Analyzing trace with hash -817344125, now seen corresponding path program 2 times [2018-04-12 02:09:38,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:38,237 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:38,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:38,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 02:09:38,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:09:38,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:09:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:38,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:09:38,475 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:09:38,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 02:09:38,508 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 02:09:38,508 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 02:09:38,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:09:38,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 02:09:38,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-12 02:09:38,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 02:09:38,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:38,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:38,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 02:09:38,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 02:09:38,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:38,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:38,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:09:38,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:38,597 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-04-12 02:09:38,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:38,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-12 02:09:38,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-12 02:09:38,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:38,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-12 02:09:38,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:09:38,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-04-12 02:09:38,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:38,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:38,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:38,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 02:09:38,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 02:09:38,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-04-12 02:09:38,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:38,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-12 02:09:38,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-12 02:09:38,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-04-12 02:09:38,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-12 02:09:38,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,832 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:61 [2018-04-12 02:09:38,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 88 [2018-04-12 02:09:38,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 02:09:38,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-12 02:09:38,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 02:09:38,925 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,928 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:38,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:38,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:96 [2018-04-12 02:09:39,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 59 [2018-04-12 02:09:39,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:39,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:39,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-12 02:09:39,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:39,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-12 02:09:39,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:39,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:39,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-12 02:09:39,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:39,067 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:39,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 02:09:39,073 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:39,074 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:39,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:39,080 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:110, output treesize:18 [2018-04-12 02:09:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:39,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:39,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-04-12 02:09:39,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-12 02:09:39,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-12 02:09:39,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2018-04-12 02:09:39,153 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 30 states. [2018-04-12 02:09:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:40,072 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-04-12 02:09:40,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-12 02:09:40,073 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-04-12 02:09:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:40,073 INFO L225 Difference]: With dead ends: 200 [2018-04-12 02:09:40,073 INFO L226 Difference]: Without dead ends: 200 [2018-04-12 02:09:40,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=1937, Unknown=0, NotChecked=0, Total=2256 [2018-04-12 02:09:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-12 02:09:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2018-04-12 02:09:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-12 02:09:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-04-12 02:09:40,076 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 56 [2018-04-12 02:09:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:40,076 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-04-12 02:09:40,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-12 02:09:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-04-12 02:09:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 02:09:40,076 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:40,077 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:40,077 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash 613514207, now seen corresponding path program 1 times [2018-04-12 02:09:40,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:40,077 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:40,077 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:40,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 02:09:40,077 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-12 02:09:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-12 02:09:40,119 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-12 02:09:40,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 02:09:40 BoogieIcfgContainer [2018-04-12 02:09:40,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 02:09:40,146 INFO L168 Benchmark]: Toolchain (without parser) took 21371.71 ms. Allocated memory was 476.1 MB in the beginning and 1.3 GB in the end (delta: 853.0 MB). Free memory was 413.9 MB in the beginning and 956.0 MB in the end (delta: -542.1 MB). Peak memory consumption was 311.0 MB. Max. memory is 5.3 GB. [2018-04-12 02:09:40,147 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 476.1 MB. Free memory is still 439.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 02:09:40,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.97 ms. Allocated memory is still 476.1 MB. Free memory was 413.9 MB in the beginning and 380.9 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. [2018-04-12 02:09:40,147 INFO L168 Benchmark]: Boogie Preprocessor took 40.99 ms. Allocated memory is still 476.1 MB. Free memory is still 380.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 02:09:40,147 INFO L168 Benchmark]: RCFGBuilder took 477.36 ms. Allocated memory was 476.1 MB in the beginning and 713.0 MB in the end (delta: 237.0 MB). Free memory was 380.9 MB in the beginning and 642.3 MB in the end (delta: -261.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 5.3 GB. [2018-04-12 02:09:40,147 INFO L168 Benchmark]: TraceAbstraction took 20599.29 ms. Allocated memory was 713.0 MB in the beginning and 1.3 GB in the end (delta: 616.0 MB). Free memory was 642.3 MB in the beginning and 956.0 MB in the end (delta: -313.7 MB). Peak memory consumption was 302.4 MB. Max. memory is 5.3 GB. [2018-04-12 02:09:40,148 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.12 ms. Allocated memory is still 476.1 MB. Free memory is still 439.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.97 ms. Allocated memory is still 476.1 MB. Free memory was 413.9 MB in the beginning and 380.9 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.99 ms. Allocated memory is still 476.1 MB. Free memory is still 380.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 477.36 ms. Allocated memory was 476.1 MB in the beginning and 713.0 MB in the end (delta: 237.0 MB). Free memory was 380.9 MB in the beginning and 642.3 MB in the end (delta: -261.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20599.29 ms. Allocated memory was 713.0 MB in the beginning and 1.3 GB in the end (delta: 616.0 MB). Free memory was 642.3 MB in the beginning and 956.0 MB in the end (delta: -313.7 MB). Peak memory consumption was 302.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L996] FCALL list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L997] FCALL list->colour = BLACK VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L999] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1006] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1006] end = end->next [L1007] FCALL end->next = ((void*)0) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] FCALL end->colour = RED VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}] [L1016] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1016] FCALL end->next = malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1017] end = end->next [L1018] FCALL end->next = ((void*)0) VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1019] FCALL end->colour = BLACK VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1027] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1028] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1038] COND FALSE !(!(end->next)) [L1038] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1039] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] EXPR, FCALL end->colour VAL [end={11:0}, end->colour=0, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1034] end = end->next [L1035] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, list={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}] [L1035] end = end->next [L1038] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 124 locations, 49 error locations. UNSAFE Result, 20.5s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 11.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1581 SDtfs, 6258 SDslu, 8301 SDs, 0 SdLazy, 13513 SolverSat, 855 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 412 SyntacticMatches, 34 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4245 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 1088 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1281 ConstructedInterpolants, 241 QuantifiedInterpolants, 1709977 SizeOfPredicates, 159 NumberOfNonLiveVariables, 1896 ConjunctsInSsa, 430 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 26/216 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-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_02-09-40-152.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_02-09-40-152.csv Received shutdown request...