java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 12:43:36,171 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 12:43:36,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 12:43:36,183 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 12:43:36,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 12:43:36,184 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 12:43:36,185 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 12:43:36,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 12:43:36,188 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 12:43:36,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 12:43:36,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 12:43:36,189 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 12:43:36,190 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 12:43:36,191 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 12:43:36,192 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 12:43:36,194 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 12:43:36,195 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 12:43:36,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 12:43:36,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 12:43:36,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 12:43:36,200 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 12:43:36,200 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 12:43:36,201 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 12:43:36,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 12:43:36,202 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 12:43:36,203 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 12:43:36,203 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 12:43:36,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 12:43:36,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 12:43:36,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 12:43:36,205 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 12:43:36,205 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-11 12:43:36,226 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 12:43:36,226 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 12:43:36,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 12:43:36,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 12:43:36,228 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 12:43:36,228 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 12:43:36,228 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 12:43:36,228 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 12:43:36,228 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 12:43:36,228 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 12:43:36,228 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 12:43:36,229 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 12:43:36,229 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 12:43:36,229 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 12:43:36,229 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 12:43:36,229 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 12:43:36,229 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 12:43:36,229 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 12:43:36,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 12:43:36,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 12:43:36,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 12:43:36,230 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 12:43:36,230 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 12:43:36,230 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 12:43:36,260 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 12:43:36,270 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 12:43:36,275 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 12:43:36,276 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 12:43:36,276 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 12:43:36,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,574 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe9a0e7cdf [2018-04-11 12:43:36,710 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 12:43:36,710 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 12:43:36,711 INFO L168 CDTParser]: Scanning sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,717 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 12:43:36,717 INFO L215 ultiparseSymbolTable]: [2018-04-11 12:43:36,718 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 12:43:36,718 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____dev_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_ulong_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____qaddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____id_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____off64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_char in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_set in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__uid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__lldiv_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____caddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,718 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__mode_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____suseconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____pthread_slist_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____timer_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsblkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blksize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____off_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsfilcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ssize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____time_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,719 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ldiv_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ushort in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_slong_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_mask in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____nlink_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ino_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutex_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__idtype_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__register_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__time_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__Colour in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__dev_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,720 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__sigset_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__id_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__loff_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fd_mask in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__nlink_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__uint in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_int in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ssize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsword_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____sig_atomic_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_attr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__wchar_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____useconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,721 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____daddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__clockid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____clock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__timer_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint8_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____key_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____loff_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_condattr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____pid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____gid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__int64_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____mode_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_long in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__daddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____intptr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__size_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,722 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__gid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__clock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrier_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____socklen_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__suseconds_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_short in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__blkcnt_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__quad_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__ulong in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____clockid_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_long in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__div_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__caddr_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_cond_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__SLL in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_short in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,723 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_char in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__off_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint32_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____int16_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i____sigset_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_once_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__blksize_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,724 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_spinlock_t in sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:36,736 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe9a0e7cdf [2018-04-11 12:43:36,740 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 12:43:36,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 12:43:36,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 12:43:36,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 12:43:36,746 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 12:43:36,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:43:36" (1/1) ... [2018-04-11 12:43:36,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2632f2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:36, skipping insertion in model container [2018-04-11 12:43:36,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:43:36" (1/1) ... [2018-04-11 12:43:36,760 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:43:36,782 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:43:36,935 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:43:36,976 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:43:36,982 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 12:43:37,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:37 WrapperNode [2018-04-11 12:43:37,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 12:43:37,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 12:43:37,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 12:43:37,022 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 12:43:37,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:37" (1/1) ... [2018-04-11 12:43:37,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:37" (1/1) ... [2018-04-11 12:43:37,045 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:37" (1/1) ... [2018-04-11 12:43:37,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:37" (1/1) ... [2018-04-11 12:43:37,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:37" (1/1) ... [2018-04-11 12:43:37,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:37" (1/1) ... [2018-04-11 12:43:37,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:37" (1/1) ... [2018-04-11 12:43:37,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 12:43:37,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 12:43:37,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 12:43:37,066 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 12:43:37,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:37" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 12:43:37,162 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 12:43:37,162 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 12:43:37,162 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 12:43:37,162 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 12:43:37,162 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 12:43:37,162 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 12:43:37,162 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 12:43:37,163 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 12:43:37,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 12:43:37,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 12:43:37,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 12:43:37,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 12:43:37,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 12:43:37,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 12:43:37,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 12:43:37,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 12:43:37,163 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 12:43:37,164 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 12:43:37,164 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 12:43:37,164 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 12:43:37,164 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 12:43:37,164 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 12:43:37,164 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 12:43:37,164 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 12:43:37,164 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 12:43:37,164 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 12:43:37,165 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 12:43:37,165 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 12:43:37,165 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 12:43:37,165 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 12:43:37,165 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 12:43:37,165 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 12:43:37,165 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 12:43:37,165 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 12:43:37,166 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 12:43:37,166 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 12:43:37,166 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 12:43:37,166 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 12:43:37,166 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 12:43:37,166 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 12:43:37,166 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 12:43:37,166 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 12:43:37,166 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 12:43:37,167 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 12:43:37,167 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 12:43:37,167 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 12:43:37,167 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 12:43:37,167 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 12:43:37,167 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 12:43:37,167 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 12:43:37,167 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 12:43:37,167 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 12:43:37,168 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 12:43:37,168 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 12:43:37,168 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 12:43:37,168 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 12:43:37,168 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 12:43:37,168 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 12:43:37,168 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 12:43:37,168 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 12:43:37,168 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 12:43:37,168 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 12:43:37,169 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 12:43:37,170 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 12:43:37,170 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 12:43:37,170 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 12:43:37,170 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 12:43:37,170 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 12:43:37,170 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 12:43:37,170 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 12:43:37,170 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 12:43:37,170 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 12:43:37,170 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 12:43:37,171 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 12:43:37,171 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 12:43:37,171 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 12:43:37,171 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 12:43:37,171 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 12:43:37,171 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 12:43:37,171 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 12:43:37,171 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 12:43:37,171 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 12:43:37,171 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 12:43:37,172 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 12:43:37,172 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 12:43:37,172 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 12:43:37,172 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 12:43:37,172 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 12:43:37,172 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 12:43:37,172 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 12:43:37,172 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 12:43:37,172 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 12:43:37,172 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 12:43:37,173 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 12:43:37,173 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 12:43:37,173 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 12:43:37,173 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 12:43:37,173 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 12:43:37,173 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 12:43:37,173 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 12:43:37,173 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 12:43:37,173 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 12:43:37,173 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 12:43:37,174 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 12:43:37,174 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 12:43:37,174 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 12:43:37,174 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 12:43:37,174 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 12:43:37,528 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 12:43:37,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:43:37 BoogieIcfgContainer [2018-04-11 12:43:37,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 12:43:37,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 12:43:37,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 12:43:37,531 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 12:43:37,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 12:43:36" (1/3) ... [2018-04-11 12:43:37,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785ab5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:43:37, skipping insertion in model container [2018-04-11 12:43:37,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:43:37" (2/3) ... [2018-04-11 12:43:37,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785ab5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:43:37, skipping insertion in model container [2018-04-11 12:43:37,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:43:37" (3/3) ... [2018-04-11 12:43:37,533 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-11 12:43:37,538 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 12:43:37,544 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2018-04-11 12:43:37,568 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 12:43:37,568 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 12:43:37,568 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 12:43:37,568 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 12:43:37,568 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 12:43:37,568 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 12:43:37,569 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 12:43:37,569 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 12:43:37,569 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 12:43:37,569 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 12:43:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-04-11 12:43:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:43:37,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:37,588 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:37,588 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash -659694479, now seen corresponding path program 1 times [2018-04-11 12:43:37,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:37,593 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:37,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:37,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:37,627 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:37,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:37,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:37,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:43:37,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:43:37,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:43:37,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:43:37,709 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 4 states. [2018-04-11 12:43:37,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:37,871 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-04-11 12:43:37,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:43:37,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:43:37,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:37,882 INFO L225 Difference]: With dead ends: 141 [2018-04-11 12:43:37,882 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 12:43:37,883 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 12:43:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-04-11 12:43:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 12:43:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-11 12:43:37,922 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 8 [2018-04-11 12:43:37,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:37,923 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-11 12:43:37,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:43:37,923 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-11 12:43:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:43:37,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:37,924 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:37,924 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:37,924 INFO L82 PathProgramCache]: Analyzing trace with hash -659694478, now seen corresponding path program 1 times [2018-04-11 12:43:37,924 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:37,924 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:37,926 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:37,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:37,926 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:37,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:37,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:37,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:37,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:43:37,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:43:37,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:43:37,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:43:37,973 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 4 states. [2018-04-11 12:43:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:38,080 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2018-04-11 12:43:38,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:43:38,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:43:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:38,082 INFO L225 Difference]: With dead ends: 135 [2018-04-11 12:43:38,082 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 12:43:38,083 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 12:43:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-04-11 12:43:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 12:43:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-04-11 12:43:38,091 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 8 [2018-04-11 12:43:38,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:38,092 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-04-11 12:43:38,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:43:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-04-11 12:43:38,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 12:43:38,092 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:38,092 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:38,093 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:38,093 INFO L82 PathProgramCache]: Analyzing trace with hash -202425566, now seen corresponding path program 1 times [2018-04-11 12:43:38,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:38,093 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:38,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:38,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:38,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:38,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:38,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:38,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:43:38,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:43:38,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:43:38,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:43:38,150 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 4 states. [2018-04-11 12:43:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:38,262 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-04-11 12:43:38,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:43:38,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 12:43:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:38,263 INFO L225 Difference]: With dead ends: 133 [2018-04-11 12:43:38,263 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 12:43:38,263 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 12:43:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2018-04-11 12:43:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-11 12:43:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-04-11 12:43:38,266 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 15 [2018-04-11 12:43:38,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:38,266 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-04-11 12:43:38,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:43:38,266 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-04-11 12:43:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 12:43:38,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:38,267 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:38,267 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:38,267 INFO L82 PathProgramCache]: Analyzing trace with hash -202425565, now seen corresponding path program 1 times [2018-04-11 12:43:38,267 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:38,267 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:38,268 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:38,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:38,268 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:38,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:38,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:38,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:43:38,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:43:38,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:43:38,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:38,321 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 5 states. [2018-04-11 12:43:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:38,449 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-04-11 12:43:38,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:43:38,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 12:43:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:38,450 INFO L225 Difference]: With dead ends: 156 [2018-04-11 12:43:38,450 INFO L226 Difference]: Without dead ends: 156 [2018-04-11 12:43:38,450 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:43:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-11 12:43:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 129. [2018-04-11 12:43:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 12:43:38,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-04-11 12:43:38,454 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 15 [2018-04-11 12:43:38,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:38,454 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-04-11 12:43:38,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:43:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-04-11 12:43:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 12:43:38,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:38,454 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:38,454 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:38,454 INFO L82 PathProgramCache]: Analyzing trace with hash -325956996, now seen corresponding path program 1 times [2018-04-11 12:43:38,455 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:38,455 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:38,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:38,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:38,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:38,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:38,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:38,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:38,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:43:38,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:43:38,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:43:38,521 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 6 states. [2018-04-11 12:43:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:38,731 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-11 12:43:38,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:43:38,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 12:43:38,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:38,732 INFO L225 Difference]: With dead ends: 216 [2018-04-11 12:43:38,732 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 12:43:38,733 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:43:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 12:43:38,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 124. [2018-04-11 12:43:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 12:43:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-04-11 12:43:38,738 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 18 [2018-04-11 12:43:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:38,739 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-04-11 12:43:38,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:43:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-04-11 12:43:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 12:43:38,739 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:38,739 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:38,740 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:38,740 INFO L82 PathProgramCache]: Analyzing trace with hash -325956997, now seen corresponding path program 1 times [2018-04-11 12:43:38,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:38,740 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:38,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:38,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:38,742 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:38,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:38,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:38,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:38,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:43:38,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:43:38,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:43:38,784 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 6 states. [2018-04-11 12:43:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:38,929 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2018-04-11 12:43:38,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 12:43:38,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 12:43:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:38,930 INFO L225 Difference]: With dead ends: 211 [2018-04-11 12:43:38,930 INFO L226 Difference]: Without dead ends: 211 [2018-04-11 12:43:38,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 12:43:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-11 12:43:38,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 123. [2018-04-11 12:43:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 12:43:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-04-11 12:43:38,934 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2018-04-11 12:43:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:38,934 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-04-11 12:43:38,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:43:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-04-11 12:43:38,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 12:43:38,935 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:38,935 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:38,935 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:38,935 INFO L82 PathProgramCache]: Analyzing trace with hash -765015574, now seen corresponding path program 1 times [2018-04-11 12:43:38,935 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:38,935 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:38,936 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:38,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:38,936 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:38,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:38,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:38,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:38,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:38,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:43:38,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:43:38,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:43:38,975 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 6 states. [2018-04-11 12:43:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:39,127 INFO L93 Difference]: Finished difference Result 224 states and 244 transitions. [2018-04-11 12:43:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 12:43:39,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 12:43:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:39,128 INFO L225 Difference]: With dead ends: 224 [2018-04-11 12:43:39,128 INFO L226 Difference]: Without dead ends: 224 [2018-04-11 12:43:39,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 12:43:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-11 12:43:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 122. [2018-04-11 12:43:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 12:43:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-04-11 12:43:39,132 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 26 [2018-04-11 12:43:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:39,133 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-04-11 12:43:39,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:43:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2018-04-11 12:43:39,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 12:43:39,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:39,134 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:39,134 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:39,134 INFO L82 PathProgramCache]: Analyzing trace with hash -765015573, now seen corresponding path program 1 times [2018-04-11 12:43:39,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:39,134 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:39,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:39,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:39,136 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:39,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:39,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:39,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:39,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:39,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:43:39,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:43:39,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:43:39,209 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand 6 states. [2018-04-11 12:43:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:39,371 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2018-04-11 12:43:39,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:43:39,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 12:43:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:39,374 INFO L225 Difference]: With dead ends: 217 [2018-04-11 12:43:39,374 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 12:43:39,375 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-11 12:43:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 12:43:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 112. [2018-04-11 12:43:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 12:43:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-04-11 12:43:39,377 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 26 [2018-04-11 12:43:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:39,378 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-04-11 12:43:39,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:43:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-04-11 12:43:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 12:43:39,379 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:39,379 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:39,379 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1849046283, now seen corresponding path program 1 times [2018-04-11 12:43:39,379 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:39,379 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:39,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:39,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:39,380 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:39,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:39,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:39,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:39,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:39,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:43:39,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:43:39,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:39,424 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 5 states. [2018-04-11 12:43:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:39,517 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-04-11 12:43:39,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:43:39,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-11 12:43:39,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:39,519 INFO L225 Difference]: With dead ends: 131 [2018-04-11 12:43:39,519 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 12:43:39,519 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:43:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 12:43:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2018-04-11 12:43:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 12:43:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-04-11 12:43:39,521 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 27 [2018-04-11 12:43:39,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:39,522 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-04-11 12:43:39,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:43:39,522 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-04-11 12:43:39,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 12:43:39,522 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:39,523 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:39,523 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:39,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1472510335, now seen corresponding path program 1 times [2018-04-11 12:43:39,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:39,523 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:39,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:39,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:39,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:39,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:39,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:39,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:39,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:43:39,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:43:39,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:39,593 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 5 states. [2018-04-11 12:43:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:39,668 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-04-11 12:43:39,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:43:39,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-11 12:43:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:39,669 INFO L225 Difference]: With dead ends: 120 [2018-04-11 12:43:39,669 INFO L226 Difference]: Without dead ends: 120 [2018-04-11 12:43:39,670 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:43:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-11 12:43:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2018-04-11 12:43:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 12:43:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-04-11 12:43:39,672 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 28 [2018-04-11 12:43:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:39,672 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-04-11 12:43:39,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:43:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-04-11 12:43:39,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 12:43:39,673 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:39,673 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:39,674 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:39,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1101576030, now seen corresponding path program 1 times [2018-04-11 12:43:39,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:39,674 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:39,675 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:39,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:39,675 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:39,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:39,730 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:39,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:43:39,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:43:39,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:43:39,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:43:39,731 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 5 states. [2018-04-11 12:43:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:39,835 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-04-11 12:43:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:43:39,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-04-11 12:43:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:39,836 INFO L225 Difference]: With dead ends: 131 [2018-04-11 12:43:39,836 INFO L226 Difference]: Without dead ends: 116 [2018-04-11 12:43:39,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:43:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-11 12:43:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-04-11 12:43:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-11 12:43:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2018-04-11 12:43:39,838 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 34 [2018-04-11 12:43:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:39,839 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2018-04-11 12:43:39,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:43:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2018-04-11 12:43:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 12:43:39,840 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:39,840 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:39,840 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738935, now seen corresponding path program 1 times [2018-04-11 12:43:39,841 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:39,841 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:39,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:39,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:39,842 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:39,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:39,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:39,985 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-11 12:43:39,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:40,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:40,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:40,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:40,078 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-11 12:43:40,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:40,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:40,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 12:43:40,143 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-11 12:43:40,146 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-11 12:43:40,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:40,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:40,157 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-11 12:43:40,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 12:43:40,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 12:43:40,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 12:43:40,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:40,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:40,227 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-11 12:43:40,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-11 12:43:40,316 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-11 12:43:40,318 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-11 12:43:40,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:40,328 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-11 12:43:40,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:40,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:40,335 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-11 12:43:40,335 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-11 12:43:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:40,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:40,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-04-11 12:43:40,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 12:43:40,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 12:43:40,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-04-11 12:43:40,408 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 21 states. [2018-04-11 12:43:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:40,986 INFO L93 Difference]: Finished difference Result 212 states and 225 transitions. [2018-04-11 12:43:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 12:43:40,987 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-04-11 12:43:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:40,987 INFO L225 Difference]: With dead ends: 212 [2018-04-11 12:43:40,987 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 12:43:40,988 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2018-04-11 12:43:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 12:43:40,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 146. [2018-04-11 12:43:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-11 12:43:40,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-04-11 12:43:40,990 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 45 [2018-04-11 12:43:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:40,990 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-04-11 12:43:40,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 12:43:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2018-04-11 12:43:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 12:43:40,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:40,991 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:40,991 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1478738936, now seen corresponding path program 1 times [2018-04-11 12:43:40,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:40,991 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:40,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:40,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:40,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:41,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:41,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:41,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 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-11 12:43:41,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:41,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:41,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:41,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:41,218 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-11 12:43:41,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,226 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-11 12:43:41,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 12:43:41,237 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-11 12:43:41,238 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-11 12:43:41,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,248 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-11 12:43:41,250 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-11 12:43:41,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,257 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-11 12:43:41,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-11 12:43:41,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-11 12:43:41,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 12:43:41,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 12:43:41,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 12:43:41,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,368 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-11 12:43:41,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-11 12:43:41,432 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-11 12:43:41,434 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-11 12:43:41,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,442 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-11 12:43:41,443 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,454 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-11 12:43:41,457 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-11 12:43:41,457 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,461 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-11 12:43:41,462 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,463 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:41,466 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-11 12:43:41,466 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-11 12:43:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:41,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:41,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-04-11 12:43:41,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 12:43:41,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 12:43:41,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-04-11 12:43:41,522 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand 17 states. [2018-04-11 12:43:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:42,183 INFO L93 Difference]: Finished difference Result 218 states and 234 transitions. [2018-04-11 12:43:42,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 12:43:42,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-04-11 12:43:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:42,185 INFO L225 Difference]: With dead ends: 218 [2018-04-11 12:43:42,185 INFO L226 Difference]: Without dead ends: 218 [2018-04-11 12:43:42,185 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-04-11 12:43:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-11 12:43:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-04-11 12:43:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 12:43:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-04-11 12:43:42,188 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 45 [2018-04-11 12:43:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:42,188 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-04-11 12:43:42,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 12:43:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-04-11 12:43:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 12:43:42,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:42,189 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:42,189 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:42,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1481333305, now seen corresponding path program 1 times [2018-04-11 12:43:42,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:42,190 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:42,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:42,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:42,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:42,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:42,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:42,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:42,696 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-11 12:43:42,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:42,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:42,738 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-11 12:43:42,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:42,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:42,746 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-11 12:43:42,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 12:43:42,766 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-11 12:43:42,767 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-11 12:43:42,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,781 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-11 12:43:42,782 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-11 12:43:42,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,789 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-11 12:43:42,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-11 12:43:42,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:42,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 12:43:42,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 12:43:42,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:42,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 12:43:42,861 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-11 12:43:42,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,875 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-04-11 12:43:42,908 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-11 12:43:42,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,924 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-11 12:43:42,926 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-11 12:43:42,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:42,936 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-11 12:43:42,936 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-04-11 12:43:43,048 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-11 12:43:43,051 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-11 12:43:43,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:43,059 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-11 12:43:43,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:43,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:43,077 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-11 12:43:43,079 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-11 12:43:43,080 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:43,085 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-11 12:43:43,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:43,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:43,094 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-11 12:43:43,094 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-04-11 12:43:43,139 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-11 12:43:43,151 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-11 12:43:43,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:43,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:43,158 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-11 12:43:43,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-11 12:43:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:43,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:43,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 33 [2018-04-11 12:43:43,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 12:43:43,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 12:43:43,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=962, Unknown=1, NotChecked=0, Total=1056 [2018-04-11 12:43:43,238 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 33 states. [2018-04-11 12:43:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:44,750 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2018-04-11 12:43:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 12:43:44,750 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2018-04-11 12:43:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:44,751 INFO L225 Difference]: With dead ends: 214 [2018-04-11 12:43:44,751 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 12:43:44,751 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=344, Invalid=2104, Unknown=2, NotChecked=0, Total=2450 [2018-04-11 12:43:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 12:43:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 145. [2018-04-11 12:43:44,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 12:43:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-04-11 12:43:44,754 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 49 [2018-04-11 12:43:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:44,754 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-04-11 12:43:44,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 12:43:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-04-11 12:43:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 12:43:44,755 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:44,756 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:44,756 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438270, now seen corresponding path program 1 times [2018-04-11 12:43:44,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:44,756 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:44,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:44,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:44,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:44,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:44,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:44,917 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-11 12:43:44,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:44,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:44,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:44,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:44,957 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-11 12:43:44,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:44,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:44,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 12:43:44,970 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-11 12:43:44,971 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-11 12:43:44,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:44,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:44,979 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-11 12:43:44,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 12:43:45,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 12:43:45,007 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-11 12:43:45,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-11 12:43:45,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:45,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:45,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:43:45,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-04-11 12:43:45,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-11 12:43:45,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 12:43:45,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,059 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-11 12:43:45,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-04-11 12:43:45,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 61 [2018-04-11 12:43:45,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-11 12:43:45,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 48 [2018-04-11 12:43:45,137 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:45,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:45,157 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-11 12:43:45,157 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:57, output treesize:75 [2018-04-11 12:43:45,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 43 [2018-04-11 12:43:45,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-04-11 12:43:45,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-04-11 12:43:45,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 12:43:45,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:45,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-04-11 12:43:45,305 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,318 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-11 12:43:45,318 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,329 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-11 12:43:45,330 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-11 12:43:45,330 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,334 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-11 12:43:45,335 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,337 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:45,342 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:89, output treesize:5 [2018-04-11 12:43:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:45,374 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:45,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2018-04-11 12:43:45,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 12:43:45,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 12:43:45,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-04-11 12:43:45,375 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 23 states. [2018-04-11 12:43:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:46,205 INFO L93 Difference]: Finished difference Result 247 states and 262 transitions. [2018-04-11 12:43:46,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 12:43:46,206 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 51 [2018-04-11 12:43:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:46,206 INFO L225 Difference]: With dead ends: 247 [2018-04-11 12:43:46,207 INFO L226 Difference]: Without dead ends: 247 [2018-04-11 12:43:46,207 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 12:43:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-11 12:43:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 176. [2018-04-11 12:43:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 12:43:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-04-11 12:43:46,211 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 51 [2018-04-11 12:43:46,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:46,212 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-04-11 12:43:46,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 12:43:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-04-11 12:43:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 12:43:46,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:46,212 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:46,212 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1731438271, now seen corresponding path program 1 times [2018-04-11 12:43:46,212 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:46,212 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:46,213 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:46,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:46,213 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:46,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:46,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:46,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:46,426 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-11 12:43:46,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:46,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:46,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:46,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:46,458 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-11 12:43:46,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 12:43:46,481 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-11 12:43:46,482 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-11 12:43:46,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,492 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-11 12:43:46,493 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-11 12:43:46,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,499 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-11 12:43:46,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-11 12:43:46,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:46,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-11 12:43:46,562 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-11 12:43:46,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:46,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 12:43:46,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 12:43:46,580 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:58 [2018-04-11 12:43:46,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:46,643 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-11 12:43:46,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:46,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:46,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:46,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 12:43:46,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:72 [2018-04-11 12:43:46,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:46,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-04-11 12:43:46,700 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-11 12:43:46,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,730 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-11 12:43:46,733 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-11 12:43:46,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,748 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-11 12:43:46,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:66 [2018-04-11 12:43:46,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2018-04-11 12:43:46,829 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-11 12:43:46,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-11 12:43:46,855 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-11 12:43:46,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:43:46,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:101 [2018-04-11 12:43:46,965 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-11 12:43:46,968 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-11 12:43:46,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:46,981 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-11 12:43:46,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:43:46,995 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-11 12:43:46,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:47,004 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-11 12:43:47,021 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-11 12:43:47,023 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-11 12:43:47,023 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:47,029 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-11 12:43:47,029 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:47,031 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:47,040 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-11 12:43:47,040 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-04-11 12:43:47,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:47,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:47,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-04-11 12:43:47,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 12:43:47,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 12:43:47,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-04-11 12:43:47,158 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 31 states. [2018-04-11 12:43:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:48,837 INFO L93 Difference]: Finished difference Result 305 states and 328 transitions. [2018-04-11 12:43:48,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 12:43:48,837 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 51 [2018-04-11 12:43:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:48,839 INFO L225 Difference]: With dead ends: 305 [2018-04-11 12:43:48,839 INFO L226 Difference]: Without dead ends: 305 [2018-04-11 12:43:48,840 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=366, Invalid=2390, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 12:43:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-11 12:43:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 178. [2018-04-11 12:43:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 12:43:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-04-11 12:43:48,845 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 51 [2018-04-11 12:43:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:48,846 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-04-11 12:43:48,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 12:43:48,846 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-04-11 12:43:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 12:43:48,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:48,847 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:48,847 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:48,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1776041815, now seen corresponding path program 1 times [2018-04-11 12:43:48,847 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:48,847 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:48,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:48,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:48,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:48,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:43:48,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:43:48,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 12:43:48,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:43:48,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:43:48,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:43:48,894 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 6 states. [2018-04-11 12:43:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:48,965 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-04-11 12:43:48,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:43:48,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-04-11 12:43:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:48,966 INFO L225 Difference]: With dead ends: 142 [2018-04-11 12:43:48,966 INFO L226 Difference]: Without dead ends: 142 [2018-04-11 12:43:48,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:43:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-11 12:43:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2018-04-11 12:43:48,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 12:43:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-04-11 12:43:48,968 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 54 [2018-04-11 12:43:48,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:48,968 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-04-11 12:43:48,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:43:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-04-11 12:43:48,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 12:43:48,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:48,969 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:48,969 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1044886106, now seen corresponding path program 2 times [2018-04-11 12:43:48,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:48,970 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:48,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:48,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:48,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:48,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:49,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:49,136 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-11 12:43:49,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 12:43:49,157 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 12:43:49,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:43:49,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:49,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:49,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:49,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-11 12:43:49,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 12:43:49,218 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-11 12:43:49,220 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-11 12:43:49,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,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-11 12:43:49,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-11 12:43:49,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,237 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-11 12:43:49,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:18 [2018-04-11 12:43:49,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 12:43:49,289 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-11 12:43:49,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-11 12:43:49,302 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-11 12:43:49,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2018-04-11 12:43:49,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:49,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:49,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-04-11 12:43:49,430 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:49,430 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-11 12:43:49,431 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-11 12:43:49,438 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:49,438 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-11 12:43:49,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,444 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-11 12:43:49,450 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-11 12:43:49,451 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:49,451 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-11 12:43:49,452 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-11 12:43:49,455 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-11 12:43:49,455 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:49,460 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-11 12:43:49,460 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-04-11 12:43:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:49,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:49,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 [2018-04-11 12:43:49,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 12:43:49,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 12:43:49,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=577, Unknown=3, NotChecked=0, Total=650 [2018-04-11 12:43:49,496 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 26 states. [2018-04-11 12:43:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:50,001 INFO L93 Difference]: Finished difference Result 151 states and 158 transitions. [2018-04-11 12:43:50,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 12:43:50,002 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-04-11 12:43:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:50,002 INFO L225 Difference]: With dead ends: 151 [2018-04-11 12:43:50,002 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 12:43:50,003 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=1237, Unknown=3, NotChecked=0, Total=1482 [2018-04-11 12:43:50,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 12:43:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2018-04-11 12:43:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 12:43:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-04-11 12:43:50,005 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 55 [2018-04-11 12:43:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:50,006 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-04-11 12:43:50,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 12:43:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-04-11 12:43:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 12:43:50,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:50,006 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:50,006 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:50,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070912, now seen corresponding path program 1 times [2018-04-11 12:43:50,007 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:50,007 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:50,008 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:50,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:43:50,008 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:50,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:50,261 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:50,261 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-11 12:43:50,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:50,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:50,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:50,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:50,296 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-11 12:43:50,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 12:43:50,332 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-11 12:43:50,334 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-11 12:43:50,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,344 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-11 12:43:50,345 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-11 12:43:50,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,353 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-11 12:43:50,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-11 12:43:50,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:50,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-04-11 12:43:50,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 12:43:50,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:50,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-04-11 12:43:50,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-11 12:43:50,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2018-04-11 12:43:50,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:50,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:50,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:50,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 12:43:50,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2018-04-11 12:43:50,558 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-11 12:43:50,561 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-11 12:43:50,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:50,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-04-11 12:43:50,583 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-11 12:43:50,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,602 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-11 12:43:50,602 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2018-04-11 12:43:50,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 112 [2018-04-11 12:43:50,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 12:43:50,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 103 [2018-04-11 12:43:50,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 12:43:50,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,738 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-11 12:43:50,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:153, output treesize:121 [2018-04-11 12:43:50,873 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-11 12:43:50,876 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-11 12:43:50,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,886 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-11 12:43:50,887 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,902 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-11 12:43:50,902 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-04-11 12:43:50,976 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-11 12:43:50,978 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-11 12:43:50,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,985 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-11 12:43:50,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:43:50,992 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-11 12:43:50,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:50,997 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-11 12:43:51,009 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-11 12:43:51,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-04-11 12:43:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:51,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:51,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-04-11 12:43:51,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 12:43:51,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 12:43:51,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 12:43:51,104 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 35 states. [2018-04-11 12:43:52,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:52,008 INFO L93 Difference]: Finished difference Result 161 states and 168 transitions. [2018-04-11 12:43:52,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 12:43:52,008 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 55 [2018-04-11 12:43:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:52,009 INFO L225 Difference]: With dead ends: 161 [2018-04-11 12:43:52,009 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 12:43:52,009 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=2026, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 12:43:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 12:43:52,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 118. [2018-04-11 12:43:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 12:43:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-04-11 12:43:52,011 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 55 [2018-04-11 12:43:52,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:52,011 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-04-11 12:43:52,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 12:43:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-04-11 12:43:52,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 12:43:52,012 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:52,012 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:52,012 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:52,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1014070911, now seen corresponding path program 1 times [2018-04-11 12:43:52,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:52,012 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:52,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:52,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:52,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:52,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:52,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:52,282 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-11 12:43:52,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:52,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:52,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:52,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:52,317 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-11 12:43:52,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 12:43:52,343 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-11 12:43:52,345 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-11 12:43:52,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,355 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-11 12:43:52,357 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-11 12:43:52,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,365 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-11 12:43:52,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2018-04-11 12:43:52,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 12:43:52,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-11 12:43:52,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2018-04-11 12:43:52,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 12:43:52,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:55 [2018-04-11 12:43:52,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:52,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:52,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:52,496 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-11 12:43:52,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 12:43:52,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-04-11 12:43:52,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-11 12:43:52,555 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-11 12:43:52,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,572 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:43:52,574 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-11 12:43:52,576 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-11 12:43:52,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,590 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-11 12:43:52,590 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:71 [2018-04-11 12:43:52,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 118 [2018-04-11 12:43:52,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 12:43:52,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 119 [2018-04-11 12:43:52,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 12:43:52,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,718 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-11 12:43:52,718 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:115 [2018-04-11 12:43:52,882 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-11 12:43:52,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-11 12:43:52,884 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-11 12:43:52,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 21 [2018-04-11 12:43:52,893 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,901 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-11 12:43:52,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,908 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-11 12:43:52,916 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-11 12:43:52,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 12:43:52,918 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:43:52,923 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-11 12:43:52,923 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,926 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-11 12:43:52,926 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,927 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:52,931 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-11 12:43:52,931 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-04-11 12:43:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:52,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:52,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2018-04-11 12:43:52,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 12:43:52,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 12:43:52,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2018-04-11 12:43:52,973 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 31 states. [2018-04-11 12:43:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:53,781 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-04-11 12:43:53,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 12:43:53,781 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 55 [2018-04-11 12:43:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:53,781 INFO L225 Difference]: With dead ends: 159 [2018-04-11 12:43:53,782 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 12:43:53,782 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=1756, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 12:43:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 12:43:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-04-11 12:43:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 12:43:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-11 12:43:53,784 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 55 [2018-04-11 12:43:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:53,784 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-11 12:43:53,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 12:43:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-11 12:43:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 12:43:53,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:53,785 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:53,785 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:53,785 INFO L82 PathProgramCache]: Analyzing trace with hash -817344126, now seen corresponding path program 3 times [2018-04-11 12:43:53,785 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:53,785 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:53,786 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:53,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:43:53,786 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:53,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:53,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:53,906 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-11 12:43:53,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 12:43:53,930 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 12:43:53,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:43:53,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:53,945 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-11 12:43:53,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:53,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:53,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 12:43:53,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:53,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:53,981 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-11 12:43:53,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:53,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:53,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 12:43:53,996 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-11 12:43:53,997 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-11 12:43:53,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:53,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,003 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-11 12:43:54,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-11 12:43:54,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:54,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 12:43:54,054 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-11 12:43:54,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-11 12:43:54,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:54,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:54,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, 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-11 12:43:54,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-04-11 12:43:54,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:54,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 12:43:54,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 12:43:54,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,118 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-11 12:43:54,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2018-04-11 12:43:54,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 61 [2018-04-11 12:43:54,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-11 12:43:54,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 48 [2018-04-11 12:43:54,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:54,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:43:54,241 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-11 12:43:54,241 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:81 [2018-04-11 12:43:54,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 49 [2018-04-11 12:43:54,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2018-04-11 12:43:54,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:43:54,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-11 12:43:54,408 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-04-11 12:43:54,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-04-11 12:43:54,447 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-04-11 12:43:54,448 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-04-11 12:43:54,464 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-04-11 12:43:54,483 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-11 12:43:54,483 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,488 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-11 12:43:54,488 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,491 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:54,499 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2018-04-11 12:43:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:54,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:54,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2018-04-11 12:43:54,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 12:43:54,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 12:43:54,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-04-11 12:43:54,535 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 31 states. [2018-04-11 12:43:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:55,633 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2018-04-11 12:43:55,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 12:43:55,633 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-04-11 12:43:55,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:55,633 INFO L225 Difference]: With dead ends: 194 [2018-04-11 12:43:55,634 INFO L226 Difference]: Without dead ends: 194 [2018-04-11 12:43:55,634 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=409, Invalid=2243, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 12:43:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-11 12:43:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-04-11 12:43:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-11 12:43:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-04-11 12:43:55,636 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 56 [2018-04-11 12:43:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:55,636 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-04-11 12:43:55,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 12:43:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-04-11 12:43:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 12:43:55,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:55,636 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:55,637 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash -817344125, now seen corresponding path program 2 times [2018-04-11 12:43:55,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:55,637 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:55,637 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:55,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:43:55,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:43:55,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:43:55,862 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:55,863 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:43:55,863 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-11 12:43:55,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 12:43:55,896 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 12:43:55,896 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:43:55,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:43:55,901 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-11 12:43:55,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:55,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:55,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 12:43:55,921 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-11 12:43:55,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:55,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:55,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:55,933 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-11 12:43:55,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:55,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:55,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 12:43:55,971 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-11 12:43:55,973 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-11 12:43:55,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:55,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:55,990 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-11 12:43:55,991 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-11 12:43:55,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:55,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,005 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-11 12:43:56,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:45 [2018-04-11 12:43:56,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:56,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 12:43:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 12:43:56,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:56,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 57 [2018-04-11 12:43:56,088 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-11 12:43:56,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-04-11 12:43:56,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:56,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:56,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:56,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 12:43:56,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 12:43:56,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-04-11 12:43:56,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:43:56,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-11 12:43:56,228 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-11 12:43:56,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,267 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-11 12:43:56,270 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-11 12:43:56,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,287 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-11 12:43:56,287 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:61 [2018-04-11 12:43:56,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 88 [2018-04-11 12:43:56,355 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-11 12:43:56,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-04-11 12:43:56,382 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-11 12:43:56,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:43:56,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:96 [2018-04-11 12:43:56,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 59 [2018-04-11 12:43:56,476 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-11 12:43:56,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,488 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-11 12:43:56,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:43:56,500 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-11 12:43:56,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,505 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-11 12:43:56,512 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-11 12:43:56,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, 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-11 12:43:56,514 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,517 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-11 12:43:56,517 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,518 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:43:56,522 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-11 12:43:56,522 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:110, output treesize:18 [2018-04-11 12:43:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:43:56,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:43:56,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-04-11 12:43:56,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 12:43:56,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 12:43:56,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2018-04-11 12:43:56,591 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 30 states. [2018-04-11 12:43:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:43:57,572 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2018-04-11 12:43:57,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 12:43:57,572 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-04-11 12:43:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:43:57,573 INFO L225 Difference]: With dead ends: 200 [2018-04-11 12:43:57,573 INFO L226 Difference]: Without dead ends: 200 [2018-04-11 12:43:57,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=1937, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 12:43:57,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-04-11 12:43:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 152. [2018-04-11 12:43:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 12:43:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-04-11 12:43:57,576 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 56 [2018-04-11 12:43:57,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:43:57,576 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-04-11 12:43:57,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 12:43:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-04-11 12:43:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 12:43:57,577 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:43:57,577 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:43:57,577 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr47AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr42AssertViolationMEMORY_FREE, mainErr46AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr39AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr48EnsuresViolationMEMORY_LEAK, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:43:57,577 INFO L82 PathProgramCache]: Analyzing trace with hash 613514207, now seen corresponding path program 1 times [2018-04-11 12:43:57,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:43:57,577 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:43:57,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:57,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:43:57,578 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:43:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 12:43:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 12:43:57,623 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 12:43:57,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 12:43:57 BoogieIcfgContainer [2018-04-11 12:43:57,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 12:43:57,656 INFO L168 Benchmark]: Toolchain (without parser) took 20915.63 ms. Allocated memory was 397.9 MB in the beginning and 980.4 MB in the end (delta: 582.5 MB). Free memory was 328.8 MB in the beginning and 852.9 MB in the end (delta: -524.0 MB). Peak memory consumption was 58.4 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:57,657 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 397.9 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 12:43:57,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.02 ms. Allocated memory is still 397.9 MB. Free memory was 328.8 MB in the beginning and 299.8 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:57,658 INFO L168 Benchmark]: Boogie Preprocessor took 44.32 ms. Allocated memory is still 397.9 MB. Free memory was 299.8 MB in the beginning and 297.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:57,658 INFO L168 Benchmark]: RCFGBuilder took 462.23 ms. Allocated memory was 397.9 MB in the beginning and 604.0 MB in the end (delta: 206.0 MB). Free memory was 297.1 MB in the beginning and 525.6 MB in the end (delta: -228.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:57,658 INFO L168 Benchmark]: TraceAbstraction took 20126.95 ms. Allocated memory was 604.0 MB in the beginning and 980.4 MB in the end (delta: 376.4 MB). Free memory was 523.0 MB in the beginning and 852.9 MB in the end (delta: -329.9 MB). Peak memory consumption was 46.6 MB. Max. memory is 5.3 GB. [2018-04-11 12:43:57,659 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.20 ms. Allocated memory is still 397.9 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 279.02 ms. Allocated memory is still 397.9 MB. Free memory was 328.8 MB in the beginning and 299.8 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.32 ms. Allocated memory is still 397.9 MB. Free memory was 299.8 MB in the beginning and 297.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 462.23 ms. Allocated memory was 397.9 MB in the beginning and 604.0 MB in the end (delta: 206.0 MB). Free memory was 297.1 MB in the beginning and 525.6 MB in the end (delta: -228.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20126.95 ms. Allocated memory was 604.0 MB in the beginning and 980.4 MB in the end (delta: 376.4 MB). Free memory was 523.0 MB in the beginning and 852.9 MB in the end (delta: -329.9 MB). Peak memory consumption was 46.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={12:0}] [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L996] FCALL list->next = ((void*)0) VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L997] FCALL list->colour = BLACK VAL [list={12:0}, malloc(sizeof(SLL))={12:0}] [L999] SLL* end = list; VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={12:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={12:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={12:0}] [L1006] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={12:0}] [L1006] end = end->next [L1007] FCALL end->next = ((void*)0) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={12:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] FCALL end->colour = RED VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={12:0}] [L1016] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1016] FCALL end->next = malloc(sizeof(SLL)) VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1017] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1017] end = end->next [L1018] FCALL end->next = ((void*)0) VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1019] FCALL end->colour = BLACK VAL [end={10:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1027] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1028] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1030] COND TRUE ((void*)0) != end VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1032] EXPR, FCALL end->colour VAL [end={12:0}, end->colour=1, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1038] COND FALSE !(!(end->next)) [L1038] COND FALSE !(0) VAL [end={12:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1039] EXPR, FCALL end->next VAL [end={12:0}, end->next={11:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={11:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1032] EXPR, FCALL end->colour VAL [end={11:0}, end->colour=0, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR, FCALL end->next VAL [end={11:0}, end->next={10:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1034] end = end->next [L1035] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, list={12:0}, malloc(sizeof(SLL))={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={12:0}] [L1035] end = end->next [L1038] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 124 locations, 49 error locations. UNSAFE Result, 20.0s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 11.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1581 SDtfs, 6258 SDslu, 8301 SDs, 0 SdLazy, 13513 SolverSat, 855 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 929 GetRequests, 412 SyntacticMatches, 34 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4245 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 1088 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1281 ConstructedInterpolants, 241 QuantifiedInterpolants, 1709977 SizeOfPredicates, 159 NumberOfNonLiveVariables, 1896 ConjunctsInSsa, 430 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 26/216 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_12-43-57-664.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_12-43-57-664.csv Received shutdown request...