java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 14:30:54,042 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 14:30:54,043 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 14:30:54,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 14:30:54,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 14:30:54,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 14:30:54,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 14:30:54,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 14:30:54,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 14:30:54,061 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 14:30:54,062 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 14:30:54,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 14:30:54,063 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 14:30:54,064 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 14:30:54,065 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 14:30:54,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 14:30:54,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 14:30:54,070 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 14:30:54,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 14:30:54,072 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 14:30:54,074 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 14:30:54,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 14:30:54,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 14:30:54,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 14:30:54,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 14:30:54,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 14:30:54,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 14:30:54,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 14:30:54,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 14:30:54,078 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 14:30:54,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 14:30:54,078 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-10 14:30:54,090 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 14:30:54,090 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 14:30:54,091 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 14:30:54,092 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 14:30:54,092 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 14:30:54,092 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 14:30:54,092 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 14:30:54,092 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 14:30:54,092 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 14:30:54,092 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 14:30:54,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 14:30:54,093 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 14:30:54,093 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 14:30:54,093 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 14:30:54,093 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 14:30:54,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 14:30:54,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 14:30:54,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 14:30:54,093 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 14:30:54,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:30:54,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 14:30:54,094 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 14:30:54,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 14:30:54,094 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 14:30:54,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 14:30:54,129 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 14:30:54,132 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 14:30:54,133 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 14:30:54,133 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 14:30:54,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,414 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG41632d47d [2018-04-10 14:30:54,543 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 14:30:54,543 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 14:30:54,544 INFO L168 CDTParser]: Scanning dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,552 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 14:30:54,552 INFO L215 ultiparseSymbolTable]: [2018-04-10 14:30:54,552 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 14:30:54,552 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,552 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 14:30:54,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,552 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ino_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ldiv_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____socklen_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsfilcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____mode_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__Colour in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__gid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_short in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____time_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsword_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ssize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_short in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,553 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____timer_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__idtype_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__mode_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____sig_atomic_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____nlink_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ssize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fd_mask in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__timer_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____pthread_slist_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,554 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__loff_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__id_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__uint in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_condattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__dev_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____qaddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blksize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____useconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____daddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,555 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__nlink_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutex_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__sigset_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__register_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,556 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_slong_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__time_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_int in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__clock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,557 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____gid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____off_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_long in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrier_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ulong in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____pid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,558 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ushort in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____loff_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__suseconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_mask in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____caddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__clockid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____dev_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_ulong_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____clock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__daddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,559 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__lldiv_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__uid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____id_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsblkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_set in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__blksize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__wchar_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_char in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__SLL in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__caddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____off64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____suseconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____sigset_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_once_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_attr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_spinlock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,560 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____clockid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_char in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_long in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__div_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____intptr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__size_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__off_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_cond_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,561 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__blkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:54,573 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG41632d47d [2018-04-10 14:30:54,577 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 14:30:54,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 14:30:54,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 14:30:54,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 14:30:54,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 14:30:54,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:30:54" (1/1) ... [2018-04-10 14:30:54,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3788dfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54, skipping insertion in model container [2018-04-10 14:30:54,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 02:30:54" (1/1) ... [2018-04-10 14:30:54,600 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:30:54,627 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 14:30:54,757 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:30:54,790 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 14:30:54,796 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 14:30:54,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54 WrapperNode [2018-04-10 14:30:54,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 14:30:54,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 14:30:54,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 14:30:54,838 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 14:30:54,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54" (1/1) ... [2018-04-10 14:30:54,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54" (1/1) ... [2018-04-10 14:30:54,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54" (1/1) ... [2018-04-10 14:30:54,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54" (1/1) ... [2018-04-10 14:30:54,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54" (1/1) ... [2018-04-10 14:30:54,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54" (1/1) ... [2018-04-10 14:30:54,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54" (1/1) ... [2018-04-10 14:30:54,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 14:30:54,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 14:30:54,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 14:30:54,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 14:30:54,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 14:30:54,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 14:30:54,970 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 14:30:54,970 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 14:30:54,970 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 14:30:54,971 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 14:30:54,971 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 14:30:54,971 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 14:30:54,971 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 14:30:54,971 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 14:30:54,971 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 14:30:54,971 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 14:30:54,971 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 14:30:54,971 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 14:30:54,972 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 14:30:54,972 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 14:30:54,972 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 14:30:54,972 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 14:30:54,972 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 14:30:54,972 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 14:30:54,972 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 14:30:54,972 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 14:30:54,973 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 14:30:54,973 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 14:30:54,973 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 14:30:54,973 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 14:30:54,973 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 14:30:54,973 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 14:30:54,973 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 14:30:54,973 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 14:30:54,973 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 14:30:54,973 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 14:30:54,974 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 14:30:54,974 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 14:30:54,974 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 14:30:54,974 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 14:30:54,974 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 14:30:54,974 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 14:30:54,974 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 14:30:54,974 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 14:30:54,974 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 14:30:54,975 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 14:30:54,975 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 14:30:54,975 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 14:30:54,975 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 14:30:54,975 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 14:30:54,975 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 14:30:54,975 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 14:30:54,975 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 14:30:54,975 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 14:30:54,975 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 14:30:54,976 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 14:30:54,976 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 14:30:54,976 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 14:30:54,976 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 14:30:54,976 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 14:30:54,976 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 14:30:54,976 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 14:30:54,976 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 14:30:54,976 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 14:30:54,977 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 14:30:54,978 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 14:30:54,978 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 14:30:54,978 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 14:30:54,978 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 14:30:54,978 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 14:30:54,978 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 14:30:54,978 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 14:30:54,978 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 14:30:54,978 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 14:30:54,978 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 14:30:54,979 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 14:30:54,979 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 14:30:54,979 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 14:30:54,979 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 14:30:54,979 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 14:30:54,979 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 14:30:54,979 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 14:30:54,979 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 14:30:54,979 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 14:30:54,980 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 14:30:54,981 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 14:30:54,982 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 14:30:54,982 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 14:30:54,982 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 14:30:54,982 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 14:30:54,982 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 14:30:54,982 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 14:30:54,982 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 14:30:55,355 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 14:30:55,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:30:55 BoogieIcfgContainer [2018-04-10 14:30:55,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 14:30:55,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 14:30:55,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 14:30:55,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 14:30:55,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 02:30:54" (1/3) ... [2018-04-10 14:30:55,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dca1a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:30:55, skipping insertion in model container [2018-04-10 14:30:55,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 02:30:54" (2/3) ... [2018-04-10 14:30:55,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dca1a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 02:30:55, skipping insertion in model container [2018-04-10 14:30:55,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 02:30:55" (3/3) ... [2018-04-10 14:30:55,361 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-10 14:30:55,366 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 14:30:55,375 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-04-10 14:30:55,399 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 14:30:55,399 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 14:30:55,399 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 14:30:55,399 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 14:30:55,399 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 14:30:55,399 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 14:30:55,399 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 14:30:55,399 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 14:30:55,399 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 14:30:55,400 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 14:30:55,410 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-04-10 14:30:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:30:55,417 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:55,417 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:55,418 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:55,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483552, now seen corresponding path program 1 times [2018-04-10 14:30:55,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:55,421 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:55,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:55,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:55,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:55,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:55,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:55,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:30:55,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:30:55,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:30:55,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:30:55,529 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2018-04-10 14:30:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:55,698 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-04-10 14:30:55,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:30:55,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:30:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:55,708 INFO L225 Difference]: With dead ends: 157 [2018-04-10 14:30:55,708 INFO L226 Difference]: Without dead ends: 153 [2018-04-10 14:30:55,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-10 14:30:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2018-04-10 14:30:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 14:30:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2018-04-10 14:30:55,745 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 8 [2018-04-10 14:30:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:55,745 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2018-04-10 14:30:55,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:30:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2018-04-10 14:30:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 14:30:55,745 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:55,746 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:55,746 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:55,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483551, now seen corresponding path program 1 times [2018-04-10 14:30:55,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:55,746 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:55,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:55,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:55,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:55,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:55,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:55,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:30:55,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:30:55,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:30:55,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:30:55,807 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 4 states. [2018-04-10 14:30:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:55,949 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-04-10 14:30:55,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 14:30:55,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 14:30:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:55,951 INFO L225 Difference]: With dead ends: 150 [2018-04-10 14:30:55,951 INFO L226 Difference]: Without dead ends: 150 [2018-04-10 14:30:55,951 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-10 14:30:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-04-10 14:30:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-10 14:30:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-04-10 14:30:55,959 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 8 [2018-04-10 14:30:55,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:55,959 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-04-10 14:30:55,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:30:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-04-10 14:30:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 14:30:55,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:55,960 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:55,960 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash -595612499, now seen corresponding path program 1 times [2018-04-10 14:30:55,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:55,961 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:55,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:55,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:55,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:55,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:56,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:56,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:56,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 14:30:56,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 14:30:56,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 14:30:56,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 14:30:56,026 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 4 states. [2018-04-10 14:30:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:56,144 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-04-10 14:30:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:30:56,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-10 14:30:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:56,145 INFO L225 Difference]: With dead ends: 146 [2018-04-10 14:30:56,145 INFO L226 Difference]: Without dead ends: 146 [2018-04-10 14:30:56,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-10 14:30:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-04-10 14:30:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-10 14:30:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-04-10 14:30:56,151 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 16 [2018-04-10 14:30:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:56,151 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-04-10 14:30:56,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 14:30:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-04-10 14:30:56,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 14:30:56,152 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:56,152 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:56,152 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:56,153 INFO L82 PathProgramCache]: Analyzing trace with hash -595612498, now seen corresponding path program 1 times [2018-04-10 14:30:56,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:56,153 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:56,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:56,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:56,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:56,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:56,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:56,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:30:56,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:30:56,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:30:56,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:56,217 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 5 states. [2018-04-10 14:30:56,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:56,355 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2018-04-10 14:30:56,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:30:56,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-10 14:30:56,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:56,356 INFO L225 Difference]: With dead ends: 174 [2018-04-10 14:30:56,357 INFO L226 Difference]: Without dead ends: 174 [2018-04-10 14:30:56,357 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:30:56,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-10 14:30:56,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 145. [2018-04-10 14:30:56,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-10 14:30:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-04-10 14:30:56,363 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 16 [2018-04-10 14:30:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:56,364 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-04-10 14:30:56,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:30:56,364 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-04-10 14:30:56,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:30:56,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:56,365 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-10 14:30:56,365 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:56,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961200, now seen corresponding path program 1 times [2018-04-10 14:30:56,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:56,365 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:56,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:56,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:56,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:56,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:56,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:56,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:30:56,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:30:56,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:30:56,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:56,408 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 5 states. [2018-04-10 14:30:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:56,566 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2018-04-10 14:30:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:30:56,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 14:30:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:56,567 INFO L225 Difference]: With dead ends: 203 [2018-04-10 14:30:56,567 INFO L226 Difference]: Without dead ends: 203 [2018-04-10 14:30:56,568 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:30:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-10 14:30:56,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 144. [2018-04-10 14:30:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-10 14:30:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-04-10 14:30:56,573 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 18 [2018-04-10 14:30:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:56,573 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-04-10 14:30:56,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:30:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-04-10 14:30:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 14:30:56,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:56,574 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-10 14:30:56,574 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:56,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961199, now seen corresponding path program 1 times [2018-04-10 14:30:56,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:56,575 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:56,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:56,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:56,576 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:56,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:56,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:56,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:30:56,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:30:56,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:30:56,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:56,621 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 5 states. [2018-04-10 14:30:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:56,795 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-04-10 14:30:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:30:56,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 14:30:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:56,796 INFO L225 Difference]: With dead ends: 227 [2018-04-10 14:30:56,797 INFO L226 Difference]: Without dead ends: 227 [2018-04-10 14:30:56,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:30:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-10 14:30:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2018-04-10 14:30:56,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-10 14:30:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-04-10 14:30:56,802 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 18 [2018-04-10 14:30:56,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:56,802 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-04-10 14:30:56,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:30:56,802 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-04-10 14:30:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:30:56,802 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:56,803 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:56,803 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:56,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009646, now seen corresponding path program 1 times [2018-04-10 14:30:56,803 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:56,803 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:56,804 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:56,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:56,804 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:56,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:56,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:56,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:30:56,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:30:56,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:30:56,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:30:56,874 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 9 states. [2018-04-10 14:30:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:57,109 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-04-10 14:30:57,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:30:57,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-10 14:30:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:57,110 INFO L225 Difference]: With dead ends: 157 [2018-04-10 14:30:57,110 INFO L226 Difference]: Without dead ends: 157 [2018-04-10 14:30:57,110 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:30:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-10 14:30:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2018-04-10 14:30:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-10 14:30:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-04-10 14:30:57,113 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 22 [2018-04-10 14:30:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:57,113 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-04-10 14:30:57,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:30:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-04-10 14:30:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 14:30:57,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:57,114 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:57,114 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:57,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009645, now seen corresponding path program 1 times [2018-04-10 14:30:57,114 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:57,114 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:57,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:57,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:57,116 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:57,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:57,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:57,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 14:30:57,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 14:30:57,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 14:30:57,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-10 14:30:57,193 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 10 states. [2018-04-10 14:30:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:57,596 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-04-10 14:30:57,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 14:30:57,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-10 14:30:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:57,598 INFO L225 Difference]: With dead ends: 162 [2018-04-10 14:30:57,598 INFO L226 Difference]: Without dead ends: 162 [2018-04-10 14:30:57,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-10 14:30:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-10 14:30:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 136. [2018-04-10 14:30:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-10 14:30:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-04-10 14:30:57,602 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 22 [2018-04-10 14:30:57,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:57,602 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-04-10 14:30:57,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 14:30:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-04-10 14:30:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 14:30:57,603 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:57,603 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:57,603 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash -582468992, now seen corresponding path program 1 times [2018-04-10 14:30:57,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:57,603 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:57,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:57,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:57,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:57,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:57,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:57,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:30:57,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:30:57,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:30:57,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:57,650 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 5 states. [2018-04-10 14:30:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:57,743 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-04-10 14:30:57,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:30:57,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-10 14:30:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:57,748 INFO L225 Difference]: With dead ends: 158 [2018-04-10 14:30:57,748 INFO L226 Difference]: Without dead ends: 158 [2018-04-10 14:30:57,748 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:30:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-10 14:30:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2018-04-10 14:30:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-10 14:30:57,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-04-10 14:30:57,751 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 28 [2018-04-10 14:30:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:57,751 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-04-10 14:30:57,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:30:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-04-10 14:30:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 14:30:57,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:57,752 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:57,752 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash -863319961, now seen corresponding path program 1 times [2018-04-10 14:30:57,752 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:57,752 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:57,753 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:57,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:57,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:57,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:57,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:30:57,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:30:57,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:30:57,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:57,816 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 5 states. [2018-04-10 14:30:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:57,911 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-04-10 14:30:57,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:30:57,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 14:30:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:57,912 INFO L225 Difference]: With dead ends: 147 [2018-04-10 14:30:57,912 INFO L226 Difference]: Without dead ends: 147 [2018-04-10 14:30:57,912 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-10 14:30:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-10 14:30:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2018-04-10 14:30:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-10 14:30:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-04-10 14:30:57,915 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 29 [2018-04-10 14:30:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:57,915 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-04-10 14:30:57,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:30:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-04-10 14:30:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 14:30:57,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:57,916 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:57,917 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash 759542753, now seen corresponding path program 1 times [2018-04-10 14:30:57,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:57,917 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:57,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:57,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:57,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:57,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:57,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:57,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:30:57,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:30:57,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:30:57,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:57,977 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 5 states. [2018-04-10 14:30:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:58,182 INFO L93 Difference]: Finished difference Result 233 states and 248 transitions. [2018-04-10 14:30:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:30:58,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 14:30:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:58,183 INFO L225 Difference]: With dead ends: 233 [2018-04-10 14:30:58,183 INFO L226 Difference]: Without dead ends: 233 [2018-04-10 14:30:58,183 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:30:58,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-10 14:30:58,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 134. [2018-04-10 14:30:58,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-10 14:30:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-04-10 14:30:58,185 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 29 [2018-04-10 14:30:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:58,185 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-04-10 14:30:58,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:30:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-04-10 14:30:58,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 14:30:58,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:58,186 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:58,186 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:58,186 INFO L82 PathProgramCache]: Analyzing trace with hash 759542752, now seen corresponding path program 1 times [2018-04-10 14:30:58,186 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:58,186 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:58,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:58,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:58,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:58,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:58,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:58,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 14:30:58,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:30:58,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:30:58,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:58,210 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 5 states. [2018-04-10 14:30:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:58,368 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-04-10 14:30:58,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 14:30:58,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 14:30:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:58,369 INFO L225 Difference]: With dead ends: 204 [2018-04-10 14:30:58,370 INFO L226 Difference]: Without dead ends: 204 [2018-04-10 14:30:58,370 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:30:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-10 14:30:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2018-04-10 14:30:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-10 14:30:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-10 14:30:58,373 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 29 [2018-04-10 14:30:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:58,373 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-10 14:30:58,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:30:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-10 14:30:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 14:30:58,374 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:58,374 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:58,374 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:58,375 INFO L82 PathProgramCache]: Analyzing trace with hash -375834398, now seen corresponding path program 1 times [2018-04-10 14:30:58,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:58,375 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:58,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:58,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:58,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:58,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:58,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:58,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 14:30:58,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 14:30:58,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 14:30:58,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 14:30:58,449 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 8 states. [2018-04-10 14:30:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:58,680 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-04-10 14:30:58,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 14:30:58,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-10 14:30:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:58,680 INFO L225 Difference]: With dead ends: 139 [2018-04-10 14:30:58,680 INFO L226 Difference]: Without dead ends: 139 [2018-04-10 14:30:58,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-10 14:30:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-10 14:30:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2018-04-10 14:30:58,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-10 14:30:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-04-10 14:30:58,682 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 33 [2018-04-10 14:30:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:58,682 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-04-10 14:30:58,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 14:30:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-04-10 14:30:58,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-10 14:30:58,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:58,683 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:58,683 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:58,684 INFO L82 PathProgramCache]: Analyzing trace with hash -375834397, now seen corresponding path program 1 times [2018-04-10 14:30:58,684 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:58,684 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:58,685 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:58,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:58,685 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:58,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:30:58,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:58,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 14:30:58,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 14:30:58,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 14:30:58,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-10 14:30:58,770 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 9 states. [2018-04-10 14:30:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:59,040 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-04-10 14:30:59,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:30:59,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-10 14:30:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:59,041 INFO L225 Difference]: With dead ends: 136 [2018-04-10 14:30:59,041 INFO L226 Difference]: Without dead ends: 136 [2018-04-10 14:30:59,041 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-10 14:30:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-10 14:30:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2018-04-10 14:30:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-10 14:30:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-10 14:30:59,043 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 33 [2018-04-10 14:30:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:59,043 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-10 14:30:59,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 14:30:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-10 14:30:59,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-10 14:30:59,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:59,044 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:59,044 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:59,044 INFO L82 PathProgramCache]: Analyzing trace with hash -736807832, now seen corresponding path program 1 times [2018-04-10 14:30:59,044 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:59,044 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:59,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:59,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:59,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:59,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:59,099 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-10 14:30:59,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:30:59,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 14:30:59,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 14:30:59,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 14:30:59,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 14:30:59,100 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 5 states. [2018-04-10 14:30:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:30:59,180 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-04-10 14:30:59,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 14:30:59,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-10 14:30:59,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:30:59,181 INFO L225 Difference]: With dead ends: 138 [2018-04-10 14:30:59,181 INFO L226 Difference]: Without dead ends: 123 [2018-04-10 14:30:59,181 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 14:30:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-10 14:30:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-04-10 14:30:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-10 14:30:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-04-10 14:30:59,183 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 35 [2018-04-10 14:30:59,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:30:59,183 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-04-10 14:30:59,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 14:30:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-04-10 14:30:59,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 14:30:59,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:30:59,183 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:30:59,184 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:30:59,184 INFO L82 PathProgramCache]: Analyzing trace with hash -799952616, now seen corresponding path program 1 times [2018-04-10 14:30:59,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:30:59,184 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:30:59,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:59,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:59,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:30:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:59,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:30:59,437 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-10 14:30:59,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:30:59,437 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-10 14:30:59,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:30:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:30:59,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:30:59,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:30:59,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:30:59,554 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-10 14:30:59,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:30:59,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:30:59,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-10 14:30:59,580 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-10 14:30:59,582 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-10 14:30:59,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:30:59,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:30:59,596 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-10 14:30:59,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-10 14:30:59,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:30:59,643 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 39 treesize of output 43 [2018-04-10 14:30:59,647 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-10 14:30:59,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:30:59,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:30:59,657 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-10 14:30:59,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-10 14:30:59,776 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 50 treesize of output 40 [2018-04-10 14:30:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 14:30:59,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:30:59,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:30:59,805 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-10 14:30:59,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:82 [2018-04-10 14:30:59,895 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-10 14:30:59,898 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-10 14:30:59,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:30:59,903 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-10 14:30:59,903 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:30:59,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:30:59,909 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-10 14:30:59,909 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-10 14:30:59,965 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-10 14:30:59,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:30:59,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2018-04-10 14:30:59,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 14:30:59,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 14:30:59,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2018-04-10 14:30:59,984 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 29 states. [2018-04-10 14:31:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:01,273 INFO L93 Difference]: Finished difference Result 241 states and 255 transitions. [2018-04-10 14:31:01,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 14:31:01,273 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 49 [2018-04-10 14:31:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:01,274 INFO L225 Difference]: With dead ends: 241 [2018-04-10 14:31:01,274 INFO L226 Difference]: Without dead ends: 241 [2018-04-10 14:31:01,276 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=786, Invalid=2874, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 14:31:01,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-10 14:31:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 156. [2018-04-10 14:31:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-10 14:31:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2018-04-10 14:31:01,279 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 49 [2018-04-10 14:31:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:01,280 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2018-04-10 14:31:01,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 14:31:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2018-04-10 14:31:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 14:31:01,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:01,281 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:01,281 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:01,281 INFO L82 PathProgramCache]: Analyzing trace with hash -799952615, now seen corresponding path program 1 times [2018-04-10 14:31:01,281 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:01,281 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:01,282 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:01,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:01,283 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:01,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:01,560 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-10 14:31:01,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:01,560 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-10 14:31:01,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:01,582 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:01,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:01,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:01,613 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-10 14:31:01,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,618 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-10 14:31:01,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:31:01,640 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-10 14:31:01,641 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-10 14:31:01,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,649 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-10 14:31:01,650 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-10 14:31:01,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,656 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-10 14:31:01,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:31:01,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:01,697 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 60 treesize of output 64 [2018-04-10 14:31:01,699 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-10 14:31:01,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:01,718 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 29 treesize of output 30 [2018-04-10 14:31:01,722 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-10 14:31:01,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,731 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-10 14:31:01,731 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-10 14:31:01,834 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 82 treesize of output 72 [2018-04-10 14:31:01,841 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 20 treesize of output 31 [2018-04-10 14:31:01,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:01,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:01,901 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 73 treesize of output 60 [2018-04-10 14:31:01,973 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 20 treesize of output 17 [2018-04-10 14:31:01,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:01,983 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 81 treesize of output 68 [2018-04-10 14:31:01,992 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 20 treesize of output 31 [2018-04-10 14:31:01,993 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:02,004 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:02,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:31:02,025 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:121 [2018-04-10 14:31:02,265 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-10 14:31:02,267 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-10 14:31:02,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:02,273 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-10 14:31:02,273 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:02,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:02,283 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-10 14:31:02,285 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-10 14:31:02,285 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:02,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 14:31:02,289 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:02,290 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:02,293 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-10 14:31:02,293 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-10 14:31:02,369 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-10 14:31:02,396 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:02,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2018-04-10 14:31:02,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 14:31:02,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 14:31:02,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2018-04-10 14:31:02,398 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand 28 states. [2018-04-10 14:31:03,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:03,908 INFO L93 Difference]: Finished difference Result 247 states and 264 transitions. [2018-04-10 14:31:03,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 14:31:03,909 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 49 [2018-04-10 14:31:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:03,910 INFO L225 Difference]: With dead ends: 247 [2018-04-10 14:31:03,910 INFO L226 Difference]: Without dead ends: 247 [2018-04-10 14:31:03,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=570, Invalid=2400, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 14:31:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-10 14:31:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 158. [2018-04-10 14:31:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-10 14:31:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-04-10 14:31:03,914 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 49 [2018-04-10 14:31:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:03,915 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-04-10 14:31:03,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 14:31:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-04-10 14:31:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 14:31:03,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:03,916 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:03,916 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash -7091430, now seen corresponding path program 1 times [2018-04-10 14:31:03,916 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:03,916 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:03,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:03,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:03,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:03,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:04,534 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-10 14:31:04,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:04,534 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-10 14:31:04,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:04,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:04,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:04,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:04,593 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-10 14:31:04,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,598 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-10 14:31:04,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-10 14:31:04,619 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-10 14:31:04,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-10 14:31:04,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,630 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-10 14:31:04,635 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-10 14:31:04,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,642 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-10 14:31:04,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-10 14:31:04,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:04,694 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 29 treesize of output 30 [2018-04-10 14:31:04,696 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-10 14:31:04,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:04,714 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 52 treesize of output 56 [2018-04-10 14:31:04,716 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-10 14:31:04,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,730 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-10 14:31:04,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-10 14:31:04,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-10 14:31:04,830 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 20 treesize of output 31 [2018-04-10 14:31:04,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:04,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:04,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-04-10 14:31:04,869 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 16 treesize of output 23 [2018-04-10 14:31:04,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:04,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:04,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-04-10 14:31:04,891 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 16 treesize of output 13 [2018-04-10 14:31:04,891 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,898 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,925 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 2 xjuncts. [2018-04-10 14:31:04,926 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:83, output treesize:129 [2018-04-10 14:31:04,975 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-10 14:31:04,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,987 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-10 14:31:04,988 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-10 14:31:04,988 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:04,996 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-10 14:31:04,996 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-04-10 14:31:05,091 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-10 14:31:05,093 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-10 14:31:05,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:05,099 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-10 14:31:05,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:05,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:05,110 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-10 14:31:05,111 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-10 14:31:05,111 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:05,114 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-10 14:31:05,115 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:05,116 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:05,120 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-10 14:31:05,120 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-04-10 14:31:05,170 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-10 14:31:05,173 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-10 14:31:05,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:05,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:05,181 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-10 14:31:05,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-10 14:31:05,243 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-10 14:31:05,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:05,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 39 [2018-04-10 14:31:05,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 14:31:05,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 14:31:05,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1362, Unknown=1, NotChecked=0, Total=1482 [2018-04-10 14:31:05,261 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 39 states. [2018-04-10 14:31:07,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:07,697 INFO L93 Difference]: Finished difference Result 245 states and 261 transitions. [2018-04-10 14:31:07,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 14:31:07,698 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2018-04-10 14:31:07,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:07,698 INFO L225 Difference]: With dead ends: 245 [2018-04-10 14:31:07,698 INFO L226 Difference]: Without dead ends: 245 [2018-04-10 14:31:07,699 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=594, Invalid=3694, Unknown=2, NotChecked=0, Total=4290 [2018-04-10 14:31:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-10 14:31:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 155. [2018-04-10 14:31:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-10 14:31:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-04-10 14:31:07,702 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 53 [2018-04-10 14:31:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:07,702 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-04-10 14:31:07,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 14:31:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-04-10 14:31:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 14:31:07,704 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:07,704 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:07,704 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash -698335515, now seen corresponding path program 1 times [2018-04-10 14:31:07,704 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:07,704 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:07,705 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:07,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:07,705 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:07,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:07,966 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-10 14:31:07,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:07,966 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-10 14:31:07,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:07,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:07,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:08,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:08,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:08,021 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-10 14:31:08,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-10 14:31:08,034 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-10 14:31:08,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 14:31:08,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,045 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-10 14:31:08,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-10 14:31:08,063 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 30 treesize of output 26 [2018-04-10 14:31:08,065 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-10 14:31:08,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,080 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-10 14:31:08,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-10 14:31:08,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-10 14:31:08,155 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 16 treesize of output 23 [2018-04-10 14:31:08,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:08,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:08,179 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 2 xjuncts. [2018-04-10 14:31:08,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:76 [2018-04-10 14:31:08,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:08,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:08,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:08,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:08,218 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-10 14:31:08,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2018-04-10 14:31:08,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:08,246 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 34 treesize of output 33 [2018-04-10 14:31:08,248 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-10 14:31:08,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,256 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-10 14:31:08,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-04-10 14:31:08,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:08,297 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 53 treesize of output 53 [2018-04-10 14:31:08,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 13 [2018-04-10 14:31:08,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,309 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-10 14:31:08,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-10 14:31:08,383 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 94 treesize of output 71 [2018-04-10 14:31:08,389 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 28 treesize of output 43 [2018-04-10 14:31:08,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:08,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:08,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 14:31:08,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:144 [2018-04-10 14:31:08,505 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 68 treesize of output 43 [2018-04-10 14:31:08,508 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-10 14:31:08,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,514 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 15 treesize of output 11 [2018-04-10 14:31:08,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,521 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-10 14:31:08,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:08,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:5 [2018-04-10 14:31:08,544 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-10 14:31:08,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:08,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 31 [2018-04-10 14:31:08,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 14:31:08,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 14:31:08,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-04-10 14:31:08,562 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 32 states. [2018-04-10 14:31:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:09,953 INFO L93 Difference]: Finished difference Result 313 states and 332 transitions. [2018-04-10 14:31:09,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 14:31:09,953 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2018-04-10 14:31:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:09,954 INFO L225 Difference]: With dead ends: 313 [2018-04-10 14:31:09,954 INFO L226 Difference]: Without dead ends: 313 [2018-04-10 14:31:09,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=502, Invalid=3038, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 14:31:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-10 14:31:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 189. [2018-04-10 14:31:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-10 14:31:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2018-04-10 14:31:09,958 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 58 [2018-04-10 14:31:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:09,959 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2018-04-10 14:31:09,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 14:31:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2018-04-10 14:31:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 14:31:09,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:09,960 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:09,960 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash -698335514, now seen corresponding path program 1 times [2018-04-10 14:31:09,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:09,960 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:09,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:09,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:09,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:09,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:10,349 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-10 14:31:10,350 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:10,350 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-10 14:31:10,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:10,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:10,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:10,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:10,392 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-10 14:31:10,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:31:10,413 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-10 14:31:10,414 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-10 14:31:10,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,424 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-10 14:31:10,436 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-10 14:31:10,436 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,447 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-10 14:31:10,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-10 14:31:10,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:10,501 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 51 treesize of output 55 [2018-04-10 14:31:10,529 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-10 14:31:10,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,543 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 29 treesize of output 30 [2018-04-10 14:31:10,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 14 treesize of output 13 [2018-04-10 14:31:10,545 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,556 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-10 14:31:10,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-10 14:31:10,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-10 14:31:10,641 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 16 treesize of output 23 [2018-04-10 14:31:10,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:10,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:10,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-04-10 14:31:10,680 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 20 treesize of output 17 [2018-04-10 14:31:10,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 68 [2018-04-10 14:31:10,698 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 20 treesize of output 31 [2018-04-10 14:31:10,698 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:10,711 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:10,735 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 2 xjuncts. [2018-04-10 14:31:10,735 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:137 [2018-04-10 14:31:10,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:10,818 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-10 14:31:10,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:10,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:10,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:10,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:10,860 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-10 14:31:10,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-04-10 14:31:10,927 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-10 14:31:10,930 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-10 14:31:10,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:10,957 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 56 treesize of output 55 [2018-04-10 14:31:10,959 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-10 14:31:10,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:10,977 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-10 14:31:10,977 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:62 [2018-04-10 14:31:11,043 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 29 treesize of output 30 [2018-04-10 14:31:11,044 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-10 14:31:11,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:11,068 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 86 treesize of output 86 [2018-04-10 14:31:11,070 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 14 treesize of output 13 [2018-04-10 14:31:11,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,091 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-10 14:31:11,092 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-04-10 14:31:11,203 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 52 treesize of output 43 [2018-04-10 14:31:11,210 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 24 treesize of output 39 [2018-04-10 14:31:11,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:11,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:11,247 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 136 treesize of output 105 [2018-04-10 14:31:11,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-04-10 14:31:11,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,264 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 148 treesize of output 113 [2018-04-10 14:31:11,271 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 28 treesize of output 43 [2018-04-10 14:31:11,271 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:11,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:11,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 14:31:11,332 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:163, output treesize:241 [2018-04-10 14:31:11,508 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-10 14:31:11,511 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-10 14:31:11,511 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-10 14:31:11,524 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-10 14:31:11,525 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,536 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-10 14:31:11,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,545 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-10 14:31:11,560 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-10 14:31:11,562 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-10 14:31:11,562 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,567 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-10 14:31:11,567 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,569 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:11,578 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-10 14:31:11,578 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-04-10 14:31:11,689 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-10 14:31:11,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:11,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-04-10 14:31:11,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 14:31:11,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 14:31:11,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 14:31:11,719 INFO L87 Difference]: Start difference. First operand 189 states and 202 transitions. Second operand 38 states. [2018-04-10 14:31:14,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:14,222 INFO L93 Difference]: Finished difference Result 321 states and 344 transitions. [2018-04-10 14:31:14,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 14:31:14,222 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 58 [2018-04-10 14:31:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:14,225 INFO L225 Difference]: With dead ends: 321 [2018-04-10 14:31:14,225 INFO L226 Difference]: Without dead ends: 321 [2018-04-10 14:31:14,226 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=488, Invalid=3802, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 14:31:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-10 14:31:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 191. [2018-04-10 14:31:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-10 14:31:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 204 transitions. [2018-04-10 14:31:14,231 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 204 transitions. Word has length 58 [2018-04-10 14:31:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:14,231 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 204 transitions. [2018-04-10 14:31:14,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 14:31:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 204 transitions. [2018-04-10 14:31:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-10 14:31:14,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:14,231 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:14,231 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash -611631047, now seen corresponding path program 1 times [2018-04-10 14:31:14,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:14,232 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:14,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:14,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:14,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:14,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:14,267 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-10 14:31:14,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 14:31:14,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 14:31:14,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 14:31:14,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 14:31:14,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-10 14:31:14,268 INFO L87 Difference]: Start difference. First operand 191 states and 204 transitions. Second operand 6 states. [2018-04-10 14:31:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:14,410 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-04-10 14:31:14,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 14:31:14,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-04-10 14:31:14,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:14,411 INFO L225 Difference]: With dead ends: 155 [2018-04-10 14:31:14,411 INFO L226 Difference]: Without dead ends: 155 [2018-04-10 14:31:14,411 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-10 14:31:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-10 14:31:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2018-04-10 14:31:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-10 14:31:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-04-10 14:31:14,413 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 58 [2018-04-10 14:31:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:14,413 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-04-10 14:31:14,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 14:31:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-04-10 14:31:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-10 14:31:14,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:14,414 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:14,414 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1513085733, now seen corresponding path program 2 times [2018-04-10 14:31:14,414 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:14,414 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:14,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:14,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:14,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:14,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:14,575 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-10 14:31:14,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:14,575 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-10 14:31:14,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:31:14,597 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:31:14,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:31:14,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:14,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:14,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:14,642 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-10 14:31:14,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:14,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:14,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:31:14,660 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-10 14:31:14,661 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-10 14:31:14,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:14,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:14,667 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-10 14:31:14,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-10 14:31:14,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:14,714 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 30 treesize of output 34 [2018-04-10 14:31:14,717 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-10 14:31:14,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:14,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:14,726 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-10 14:31:14,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-10 14:31:14,836 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 68 treesize of output 58 [2018-04-10 14:31:14,846 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 24 treesize of output 39 [2018-04-10 14:31:14,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:14,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:14,880 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 60 treesize of output 53 [2018-04-10 14:31:14,882 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-10 14:31:14,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:14,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:14,891 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 49 [2018-04-10 14:31:14,900 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-10 14:31:14,901 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:14,905 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:14,920 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 2 xjuncts. [2018-04-10 14:31:14,920 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:98 [2018-04-10 14:31:15,061 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:15,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 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-10 14:31:15,064 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:15,064 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-10 14:31:15,065 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-10 14:31:15,070 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:15,071 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-10 14:31:15,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:15,075 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-10 14:31:15,082 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-10 14:31:15,083 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:15,083 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-10 14:31:15,083 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-10 14:31:15,087 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-10 14:31:15,087 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:15,088 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:15,091 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-10 14:31:15,091 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-04-10 14:31:15,100 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-10 14:31:15,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:15,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 29 [2018-04-10 14:31:15,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 14:31:15,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 14:31:15,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=725, Unknown=3, NotChecked=0, Total=812 [2018-04-10 14:31:15,118 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 29 states. [2018-04-10 14:31:15,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:15,721 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2018-04-10 14:31:15,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 14:31:15,723 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 59 [2018-04-10 14:31:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:15,723 INFO L225 Difference]: With dead ends: 167 [2018-04-10 14:31:15,723 INFO L226 Difference]: Without dead ends: 142 [2018-04-10 14:31:15,723 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=326, Invalid=1741, Unknown=3, NotChecked=0, Total=2070 [2018-04-10 14:31:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-10 14:31:15,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-04-10 14:31:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-10 14:31:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-04-10 14:31:15,725 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 59 [2018-04-10 14:31:15,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:15,725 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-04-10 14:31:15,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 14:31:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-04-10 14:31:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:31:15,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:15,726 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:15,726 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:15,726 INFO L82 PathProgramCache]: Analyzing trace with hash 484223591, now seen corresponding path program 1 times [2018-04-10 14:31:15,726 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:15,726 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:15,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:15,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:31:15,727 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:15,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:16,007 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-10 14:31:16,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:16,007 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-10 14:31:16,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:16,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:16,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,038 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-10 14:31:16,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:31:16,059 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-10 14:31:16,060 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-10 14:31:16,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,071 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-10 14:31:16,073 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-10 14:31:16,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,080 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-10 14:31:16,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-10 14:31:16,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,120 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 51 treesize of output 55 [2018-04-10 14:31:16,122 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-10 14:31:16,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,135 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 29 treesize of output 30 [2018-04-10 14:31:16,136 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-10 14:31:16,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,145 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-10 14:31:16,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-10 14:31:16,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-04-10 14:31:16,237 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 20 treesize of output 39 [2018-04-10 14:31:16,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:16,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:16,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 73 [2018-04-10 14:31:16,289 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 16 treesize of output 31 [2018-04-10 14:31:16,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:16,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:16,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 69 [2018-04-10 14:31:16,306 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:16,307 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 16 treesize of output 17 [2018-04-10 14:31:16,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,330 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,354 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 2 xjuncts. [2018-04-10 14:31:16,354 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:155 [2018-04-10 14:31:16,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,407 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 22 treesize of output 42 [2018-04-10 14:31:16,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:83 [2018-04-10 14:31:16,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,460 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 62 treesize of output 61 [2018-04-10 14:31:16,463 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-10 14:31:16,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,484 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-10 14:31:16,486 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-10 14:31:16,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,501 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-10 14:31:16,501 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:81 [2018-04-10 14:31:16,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:16,571 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 104 treesize of output 120 [2018-04-10 14:31:16,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 13 [2018-04-10 14:31:16,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,600 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 49 treesize of output 50 [2018-04-10 14:31:16,601 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-10 14:31:16,602 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,617 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-10 14:31:16,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:99 [2018-04-10 14:31:16,743 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 191 treesize of output 144 [2018-04-10 14:31:16,771 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 32 treesize of output 51 [2018-04-10 14:31:16,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:16,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:16,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:16,821 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 162 treesize of output 141 [2018-04-10 14:31:16,822 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 37 treesize of output 32 [2018-04-10 14:31:16,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,835 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 182 treesize of output 156 [2018-04-10 14:31:16,837 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:16,837 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 32 treesize of output 48 [2018-04-10 14:31:16,837 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,847 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:16,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:31:16,879 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:203, output treesize:289 [2018-04-10 14:31:16,991 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-10 14:31:16,994 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-10 14:31:16,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:17,003 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-10 14:31:17,003 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:17,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:17,017 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-10 14:31:17,017 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-04-10 14:31:17,085 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-10 14:31:17,086 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-10 14:31:17,087 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-10 14:31:17,093 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-10 14:31:17,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:17,100 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-10 14:31:17,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:17,104 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-10 14:31:17,112 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-10 14:31:17,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-04-10 14:31:17,188 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-10 14:31:17,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:17,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-04-10 14:31:17,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 14:31:17,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 14:31:17,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 14:31:17,206 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 40 states. [2018-04-10 14:31:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:18,726 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2018-04-10 14:31:18,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 14:31:18,726 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 62 [2018-04-10 14:31:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:18,727 INFO L225 Difference]: With dead ends: 179 [2018-04-10 14:31:18,727 INFO L226 Difference]: Without dead ends: 179 [2018-04-10 14:31:18,728 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=508, Invalid=3524, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 14:31:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-10 14:31:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 131. [2018-04-10 14:31:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 14:31:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-04-10 14:31:18,729 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 62 [2018-04-10 14:31:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:18,729 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-04-10 14:31:18,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 14:31:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-04-10 14:31:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-10 14:31:18,730 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:18,730 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:18,730 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:18,730 INFO L82 PathProgramCache]: Analyzing trace with hash 484223592, now seen corresponding path program 1 times [2018-04-10 14:31:18,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:18,730 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:18,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:18,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:18,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:18,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:19,152 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-10 14:31:19,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:19,153 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-10 14:31:19,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:19,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:19,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,199 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-10 14:31:19,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-10 14:31:19,205 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-10 14:31:19,207 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-10 14:31:19,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,214 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-10 14:31:19,215 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-10 14:31:19,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,220 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-10 14:31:19,220 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-04-10 14:31:19,229 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-10 14:31:19,230 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-10 14:31:19,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,240 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 43 treesize of output 39 [2018-04-10 14:31:19,241 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-10 14:31:19,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,249 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-10 14:31:19,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-04-10 14:31:19,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-10 14:31:19,333 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 20 treesize of output 39 [2018-04-10 14:31:19,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:19,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:19,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-04-10 14:31:19,369 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 16 treesize of output 31 [2018-04-10 14:31:19,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:19,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:19,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-04-10 14:31:19,388 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:19,389 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 16 treesize of output 17 [2018-04-10 14:31:19,391 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,399 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,422 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 2 xjuncts. [2018-04-10 14:31:19,422 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:141 [2018-04-10 14:31:19,501 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-10 14:31:19,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,515 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-10 14:31:19,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-04-10 14:31:19,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,561 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 53 treesize of output 52 [2018-04-10 14:31:19,564 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-10 14:31:19,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,584 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:19,586 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-10 14:31:19,587 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-10 14:31:19,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,599 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-10 14:31:19,599 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:75 [2018-04-10 14:31:19,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,658 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 110 treesize of output 126 [2018-04-10 14:31:19,660 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 14 treesize of output 13 [2018-04-10 14:31:19,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:19,686 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 69 treesize of output 90 [2018-04-10 14:31:19,693 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-10 14:31:19,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,716 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-10 14:31:19,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:117, output treesize:97 [2018-04-10 14:31:19,842 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 197 treesize of output 150 [2018-04-10 14:31:19,850 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 32 treesize of output 51 [2018-04-10 14:31:19,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:19,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:19,908 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 161 treesize of output 135 [2018-04-10 14:31:19,911 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 32 treesize of output 25 [2018-04-10 14:31:19,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:19,926 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 181 treesize of output 155 [2018-04-10 14:31:19,934 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 32 treesize of output 51 [2018-04-10 14:31:19,934 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:19,948 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:19,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:31:19,976 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:197, output treesize:281 [2018-04-10 14:31:20,184 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-10 14:31:20,186 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 56 treesize of output 23 [2018-04-10 14:31:20,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:20,194 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-10 14:31:20,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:20,201 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 39 treesize of output 31 [2018-04-10 14:31:20,201 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:31:20,207 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-10 14:31:20,216 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-10 14:31:20,217 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-10 14:31:20,217 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:20,223 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 15 treesize of output 3 [2018-04-10 14:31:20,223 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:20,225 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:20,230 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-10 14:31:20,230 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-04-10 14:31:20,273 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-10 14:31:20,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:20,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 35 [2018-04-10 14:31:20,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 14:31:20,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 14:31:20,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 14:31:20,291 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 36 states. [2018-04-10 14:31:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:21,800 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-04-10 14:31:21,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 14:31:21,800 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2018-04-10 14:31:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:21,801 INFO L225 Difference]: With dead ends: 177 [2018-04-10 14:31:21,801 INFO L226 Difference]: Without dead ends: 177 [2018-04-10 14:31:21,802 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=334, Invalid=2972, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 14:31:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-10 14:31:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2018-04-10 14:31:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 14:31:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-04-10 14:31:21,804 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 62 [2018-04-10 14:31:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:21,804 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-04-10 14:31:21,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 14:31:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-04-10 14:31:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:31:21,804 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:21,804 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:21,804 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:21,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400824, now seen corresponding path program 3 times [2018-04-10 14:31:21,805 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:21,805 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:21,806 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:21,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 14:31:21,806 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:21,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:22,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:22,190 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-10 14:31:22,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 14:31:22,229 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 14:31:22,229 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:31:22,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:22,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:22,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:22,241 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-10 14:31:22,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-10 14:31:22,267 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-10 14:31:22,269 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-10 14:31:22,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,276 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-10 14:31:22,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-10 14:31:22,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:22,327 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 30 treesize of output 34 [2018-04-10 14:31:22,329 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-10 14:31:22,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,337 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-10 14:31:22,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-10 14:31:22,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-10 14:31:22,418 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 16 treesize of output 23 [2018-04-10 14:31:22,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:22,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:22,438 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 2 xjuncts. [2018-04-10 14:31:22,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:82 [2018-04-10 14:31:22,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:22,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:22,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:22,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:22,481 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-10 14:31:22,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2018-04-10 14:31:22,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:22,514 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 34 treesize of output 33 [2018-04-10 14:31:22,516 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-10 14:31:22,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,524 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-10 14:31:22,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:35 [2018-04-10 14:31:22,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:22,577 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 53 treesize of output 53 [2018-04-10 14:31:22,578 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 14 treesize of output 13 [2018-04-10 14:31:22,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,591 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-10 14:31:22,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-10 14:31:22,689 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 94 treesize of output 71 [2018-04-10 14:31:22,697 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 28 treesize of output 43 [2018-04-10 14:31:22,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:22,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:22,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 14:31:22,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:150 [2018-04-10 14:31:22,851 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2018-04-10 14:31:22,852 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-10 14:31:22,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,858 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:22,859 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 27 treesize of output 19 [2018-04-10 14:31:22,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,864 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 13 treesize of output 9 [2018-04-10 14:31:22,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:22,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:5 [2018-04-10 14:31:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:22,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:22,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 38 [2018-04-10 14:31:22,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 14:31:22,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 14:31:22,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 14:31:22,910 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 39 states. [2018-04-10 14:31:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:24,586 INFO L93 Difference]: Finished difference Result 216 states and 225 transitions. [2018-04-10 14:31:24,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 14:31:24,587 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 63 [2018-04-10 14:31:24,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:24,587 INFO L225 Difference]: With dead ends: 216 [2018-04-10 14:31:24,587 INFO L226 Difference]: Without dead ends: 216 [2018-04-10 14:31:24,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=662, Invalid=3760, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 14:31:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-10 14:31:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 166. [2018-04-10 14:31:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-10 14:31:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 176 transitions. [2018-04-10 14:31:24,590 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 176 transitions. Word has length 63 [2018-04-10 14:31:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:24,591 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 176 transitions. [2018-04-10 14:31:24,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 14:31:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2018-04-10 14:31:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-10 14:31:24,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:24,592 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:24,592 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:24,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400823, now seen corresponding path program 2 times [2018-04-10 14:31:24,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:24,592 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:24,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:24,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:31:24,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 14:31:24,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 14:31:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:25,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 14:31:25,091 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-10 14:31:25,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 14:31:25,121 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 14:31:25,121 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 14:31:25,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 14:31:25,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-10 14:31:25,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2018-04-10 14:31:25,230 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-10 14:31:25,231 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-10 14:31:25,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,242 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-10 14:31:25,244 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-10 14:31:25,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,253 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-10 14:31:25,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:43 [2018-04-10 14:31:25,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,310 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 29 treesize of output 30 [2018-04-10 14:31:25,312 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-10 14:31:25,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,329 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 52 treesize of output 56 [2018-04-10 14:31:25,331 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-10 14:31:25,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,345 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-10 14:31:25,346 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:85, output treesize:69 [2018-04-10 14:31:25,461 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-04-10 14:31:25,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,468 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 16 treesize of output 35 [2018-04-10 14:31:25,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:25,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:25,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,506 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:25,515 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-04-10 14:31:25,517 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:25,517 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 25 treesize of output 24 [2018-04-10 14:31:25,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,531 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 92 [2018-04-10 14:31:25,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,533 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:25,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 54 [2018-04-10 14:31:25,534 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,545 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,567 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 2 xjuncts. [2018-04-10 14:31:25,567 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:102, output treesize:185 [2018-04-10 14:31:25,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,664 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-10 14:31:25,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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-10 14:31:25,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:86 [2018-04-10 14:31:25,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 72 [2018-04-10 14:31:25,739 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 27 treesize of output 34 [2018-04-10 14:31:25,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,762 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:25,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2018-04-10 14:31:25,765 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 30 [2018-04-10 14:31:25,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,780 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-10 14:31:25,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:96 [2018-04-10 14:31:25,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 141 [2018-04-10 14:31:25,860 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 14 treesize of output 13 [2018-04-10 14:31:25,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:25,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 101 [2018-04-10 14:31:25,893 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-10 14:31:25,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:25,914 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-10 14:31:25,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:138, output treesize:114 [2018-04-10 14:31:26,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:26,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:26,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 173 [2018-04-10 14:31:26,081 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 32 treesize of output 51 [2018-04-10 14:31:26,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 14:31:26,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 14:31:26,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:26,142 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:26,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 162 [2018-04-10 14:31:26,146 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 37 treesize of output 32 [2018-04-10 14:31:26,146 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:26,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:26,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:26,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 177 [2018-04-10 14:31:26,175 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:26,175 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 32 treesize of output 48 [2018-04-10 14:31:26,176 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:26,189 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:26,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 14:31:26,221 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:218, output treesize:319 [2018-04-10 14:31:26,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:26,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 14:31:26,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 107 [2018-04-10 14:31:26,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, 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-10 14:31:26,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:26,423 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:26,423 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 50 treesize of output 40 [2018-04-10 14:31:26,423 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:26,431 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 21 [2018-04-10 14:31:26,431 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 14:31:26,437 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-10 14:31:26,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-04-10 14:31:26,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-10 14:31:26,452 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:26,458 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-10 14:31:26,458 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:26,462 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 14:31:26,462 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 20 treesize of output 14 [2018-04-10 14:31:26,462 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 14:31:26,465 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 14:31:26,472 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-10 14:31:26,472 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:153, output treesize:20 [2018-04-10 14:31:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 14:31:26,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 14:31:26,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 43 [2018-04-10 14:31:26,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 14:31:26,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 14:31:26,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 14:31:26,587 INFO L87 Difference]: Start difference. First operand 166 states and 176 transitions. Second operand 44 states. [2018-04-10 14:31:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 14:31:28,482 INFO L93 Difference]: Finished difference Result 214 states and 226 transitions. [2018-04-10 14:31:28,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 14:31:28,482 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2018-04-10 14:31:28,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 14:31:28,482 INFO L225 Difference]: With dead ends: 214 [2018-04-10 14:31:28,483 INFO L226 Difference]: Without dead ends: 214 [2018-04-10 14:31:28,483 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=735, Invalid=4667, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 14:31:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-10 14:31:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 168. [2018-04-10 14:31:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 14:31:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-04-10 14:31:28,485 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 63 [2018-04-10 14:31:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 14:31:28,486 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-04-10 14:31:28,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 14:31:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-04-10 14:31:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-10 14:31:28,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 14:31:28,487 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 14:31:28,487 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 14:31:28,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1290037367, now seen corresponding path program 1 times [2018-04-10 14:31:28,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 14:31:28,487 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 14:31:28,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:28,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 14:31:28,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 14:31:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 14:31:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-10 14:31:28,541 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-10 14:31:28,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 02:31:28 BoogieIcfgContainer [2018-04-10 14:31:28,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 14:31:28,577 INFO L168 Benchmark]: Toolchain (without parser) took 33999.81 ms. Allocated memory was 395.3 MB in the beginning and 1.0 GB in the end (delta: 623.9 MB). Free memory was 332.9 MB in the beginning and 393.0 MB in the end (delta: -60.1 MB). Peak memory consumption was 563.8 MB. Max. memory is 5.3 GB. [2018-04-10 14:31:28,578 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 395.3 MB. Free memory is still 357.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 14:31:28,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.72 ms. Allocated memory is still 395.3 MB. Free memory was 331.6 MB in the beginning and 305.0 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-04-10 14:31:28,579 INFO L168 Benchmark]: Boogie Preprocessor took 46.62 ms. Allocated memory is still 395.3 MB. Free memory was 305.0 MB in the beginning and 301.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-10 14:31:28,579 INFO L168 Benchmark]: RCFGBuilder took 471.29 ms. Allocated memory was 395.3 MB in the beginning and 589.8 MB in the end (delta: 194.5 MB). Free memory was 301.1 MB in the beginning and 508.6 MB in the end (delta: -207.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-04-10 14:31:28,579 INFO L168 Benchmark]: TraceAbstraction took 33219.77 ms. Allocated memory was 589.8 MB in the beginning and 1.0 GB in the end (delta: 429.4 MB). Free memory was 508.6 MB in the beginning and 393.0 MB in the end (delta: 115.5 MB). Peak memory consumption was 544.9 MB. Max. memory is 5.3 GB. [2018-04-10 14:31:28,581 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 395.3 MB. Free memory is still 357.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 258.72 ms. Allocated memory is still 395.3 MB. Free memory was 331.6 MB in the beginning and 305.0 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.62 ms. Allocated memory is still 395.3 MB. Free memory was 305.0 MB in the beginning and 301.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 471.29 ms. Allocated memory was 395.3 MB in the beginning and 589.8 MB in the end (delta: 194.5 MB). Free memory was 301.1 MB in the beginning and 508.6 MB in the end (delta: -207.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 33219.77 ms. Allocated memory was 589.8 MB in the beginning and 1.0 GB in the end (delta: 429.4 MB). Free memory was 508.6 MB in the beginning and 393.0 MB in the end (delta: 115.5 MB). Peak memory consumption was 544.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={16:0}] [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L995] FCALL list->next = ((void*)0) VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L996] FCALL list->prev = ((void*)0) VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L997] FCALL list->colour = BLACK VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L999] SLL* end = list; VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1006] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1006] FCALL end->next->prev = end VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1007] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1017] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1017] FCALL end->next = malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1018] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1018] FCALL end->next->prev = end VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1019] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1021] FCALL end->colour = BLACK VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1029] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1030] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1030] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1032] COND TRUE ((void*)0) != end VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1034] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1040] COND FALSE !(!(end->next)) [L1040] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1041] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1034] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=0, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}, malloc(sizeof(SLL))={14:0}] [L1036] end = end->next [L1037] EXPR, FCALL end->next VAL [end={15:0}, end->next={0:0}, list={16:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1037] end = end->next [L1040] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 59 error locations. UNSAFE Result, 33.1s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 19.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2050 SDtfs, 8711 SDslu, 11873 SDs, 0 SdLazy, 19788 SolverSat, 1418 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1178 GetRequests, 439 SyntacticMatches, 31 SemanticMatches, 708 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9301 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 1220 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 1619 NumberOfCodeBlocks, 1619 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1518 ConstructedInterpolants, 297 QuantifiedInterpolants, 2351231 SizeOfPredicates, 190 NumberOfNonLiveVariables, 2196 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 26/228 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_14-31-28-587.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_14-31-28-587.csv Received shutdown request...