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/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-12 02:08:28,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-12 02:08:28,405 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-12 02:08:28,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-12 02:08:28,417 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-12 02:08:28,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-12 02:08:28,418 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-12 02:08:28,420 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-12 02:08:28,422 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-12 02:08:28,422 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-12 02:08:28,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-12 02:08:28,423 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-12 02:08:28,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-12 02:08:28,425 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-12 02:08:28,426 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-12 02:08:28,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-12 02:08:28,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-12 02:08:28,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-12 02:08:28,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-12 02:08:28,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-12 02:08:28,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-12 02:08:28,434 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-12 02:08:28,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-12 02:08:28,435 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-12 02:08:28,436 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-12 02:08:28,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-12 02:08:28,437 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-12 02:08:28,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-12 02:08:28,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-12 02:08:28,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-12 02:08:28,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-12 02:08:28,439 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-12 02:08:28,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-12 02:08:28,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-12 02:08:28,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-12 02:08:28,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-12 02:08:28,463 INFO L133 SettingsManager]: * Use SBE=true [2018-04-12 02:08:28,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-12 02:08:28,463 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-12 02:08:28,463 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-12 02:08:28,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-12 02:08:28,464 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-12 02:08:28,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-12 02:08:28,464 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-12 02:08:28,464 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-12 02:08:28,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-12 02:08:28,465 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-12 02:08:28,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-12 02:08:28,465 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-12 02:08:28,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-12 02:08:28,465 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-12 02:08:28,465 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 02:08:28,466 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-12 02:08:28,466 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-12 02:08:28,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-12 02:08:28,466 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-12 02:08:28,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-12 02:08:28,506 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-12 02:08:28,509 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-12 02:08:28,510 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-12 02:08:28,512 INFO L276 PluginConnector]: CDTParser initialized [2018-04-12 02:08:28,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,811 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06cbd4a3c [2018-04-12 02:08:28,945 INFO L287 CDTParser]: IsIndexed: true [2018-04-12 02:08:28,945 INFO L288 CDTParser]: Found 1 translation units. [2018-04-12 02:08:28,946 INFO L168 CDTParser]: Scanning dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,953 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-12 02:08:28,953 INFO L215 ultiparseSymbolTable]: [2018-04-12 02:08:28,954 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-12 02:08:28,954 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ino_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ldiv_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____socklen_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsfilcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____mode_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__Colour in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__gid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,954 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_short in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____time_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsword_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ssize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_short in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsfilcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutexattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____timer_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__idtype_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__mode_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____sig_atomic_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,955 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____nlink_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ssize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fd_mask in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__timer_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____pthread_slist_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__loff_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__id_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__uint in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_condattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,956 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__dev_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____qaddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blksize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____useconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____daddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__nlink_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_mutex_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,957 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____blkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__sigset_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsblkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__register_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrierattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_slong_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__time_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_int in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_key_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__clock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,958 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_rwlockattr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,959 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,959 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,959 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____gid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,959 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____off_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,959 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,959 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_long in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,959 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_barrier_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,959 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,959 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ulong in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,959 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____ino_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____fsid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____pid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__ushort in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____loff_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__suseconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_mask in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____caddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__clockid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,960 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____dev_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____syscall_ulong_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____clock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__daddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____uint32_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int8_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__lldiv_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__uid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____id_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fsblkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,961 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__fd_set in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__blksize_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__wchar_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_char in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__SLL in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__caddr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____off64_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____suseconds_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____sigset_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_once_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_attr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_spinlock_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____rlim_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____clockid_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_char in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____u_long in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,962 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__div_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i____intptr_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__size_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__off_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__u_int16_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__pthread_cond_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__quad_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,963 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_cnstr___false_unreach_call_false_valid_deref_i__blkcnt_t in dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:28,976 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06cbd4a3c [2018-04-12 02:08:28,979 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-12 02:08:28,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-12 02:08:28,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-12 02:08:28,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-12 02:08:28,984 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-12 02:08:28,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 02:08:28" (1/1) ... [2018-04-12 02:08:28,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13838234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:28, skipping insertion in model container [2018-04-12 02:08:28,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.04 02:08:28" (1/1) ... [2018-04-12 02:08:28,997 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 02:08:29,025 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-12 02:08:29,153 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 02:08:29,190 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-12 02:08:29,196 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-12 02:08:29,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:29 WrapperNode [2018-04-12 02:08:29,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-12 02:08:29,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-12 02:08:29,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-12 02:08:29,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-12 02:08:29,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:29" (1/1) ... [2018-04-12 02:08:29,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:29" (1/1) ... [2018-04-12 02:08:29,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:29" (1/1) ... [2018-04-12 02:08:29,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:29" (1/1) ... [2018-04-12 02:08:29,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:29" (1/1) ... [2018-04-12 02:08:29,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:29" (1/1) ... [2018-04-12 02:08:29,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:29" (1/1) ... [2018-04-12 02:08:29,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-12 02:08:29,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-12 02:08:29,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-12 02:08:29,278 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-12 02:08:29,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:29" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-12 02:08:29,393 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-12 02:08:29,393 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-12 02:08:29,393 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-12 02:08:29,393 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-12 02:08:29,394 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-12 02:08:29,395 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-12 02:08:29,395 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-12 02:08:29,395 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-12 02:08:29,395 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-12 02:08:29,395 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-12 02:08:29,395 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-12 02:08:29,395 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-12 02:08:29,395 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-12 02:08:29,395 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-12 02:08:29,395 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-12 02:08:29,396 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-12 02:08:29,396 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-12 02:08:29,396 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-12 02:08:29,396 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-12 02:08:29,396 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-12 02:08:29,396 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-12 02:08:29,396 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-12 02:08:29,396 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-12 02:08:29,396 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-12 02:08:29,397 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-12 02:08:29,397 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-12 02:08:29,397 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-12 02:08:29,397 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-12 02:08:29,397 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-12 02:08:29,397 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-12 02:08:29,397 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-12 02:08:29,397 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-12 02:08:29,397 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-12 02:08:29,397 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-12 02:08:29,398 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-12 02:08:29,398 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-12 02:08:29,398 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-12 02:08:29,398 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-12 02:08:29,398 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-12 02:08:29,398 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-12 02:08:29,398 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-12 02:08:29,398 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-12 02:08:29,398 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-12 02:08:29,399 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-12 02:08:29,400 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-12 02:08:29,401 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-12 02:08:29,401 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-12 02:08:29,401 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-12 02:08:29,401 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-12 02:08:29,401 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-12 02:08:29,401 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-12 02:08:29,401 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-12 02:08:29,401 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-12 02:08:29,401 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-12 02:08:29,401 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-12 02:08:29,402 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-12 02:08:29,403 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-12 02:08:29,404 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-12 02:08:29,404 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-12 02:08:29,404 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-12 02:08:29,404 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-12 02:08:29,404 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-12 02:08:29,404 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-12 02:08:29,404 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-12 02:08:29,404 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-12 02:08:29,404 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-12 02:08:29,404 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-12 02:08:29,804 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-12 02:08:29,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 02:08:29 BoogieIcfgContainer [2018-04-12 02:08:29,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-12 02:08:29,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-12 02:08:29,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-12 02:08:29,807 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-12 02:08:29,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.04 02:08:28" (1/3) ... [2018-04-12 02:08:29,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abf0c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 02:08:29, skipping insertion in model container [2018-04-12 02:08:29,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.04 02:08:29" (2/3) ... [2018-04-12 02:08:29,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3abf0c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.04 02:08:29, skipping insertion in model container [2018-04-12 02:08:29,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.04 02:08:29" (3/3) ... [2018-04-12 02:08:29,809 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-04-12 02:08:29,817 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-12 02:08:29,824 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 59 error locations. [2018-04-12 02:08:29,847 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-12 02:08:29,847 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-12 02:08:29,847 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-12 02:08:29,847 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-12 02:08:29,848 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-12 02:08:29,848 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-12 02:08:29,848 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-12 02:08:29,848 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-12 02:08:29,848 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-12 02:08:29,848 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-12 02:08:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-04-12 02:08:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 02:08:29,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:29,866 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:29,866 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:29,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483552, now seen corresponding path program 1 times [2018-04-12 02:08:29,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:29,869 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:29,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:29,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:29,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:29,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:29,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:29,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 02:08:29,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 02:08:29,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 02:08:29,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 02:08:29,980 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2018-04-12 02:08:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:30,132 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2018-04-12 02:08:30,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:08:30,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 02:08:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:30,140 INFO L225 Difference]: With dead ends: 157 [2018-04-12 02:08:30,140 INFO L226 Difference]: Without dead ends: 153 [2018-04-12 02:08:30,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:30,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-12 02:08:30,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2018-04-12 02:08:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 02:08:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 141 transitions. [2018-04-12 02:08:30,179 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 141 transitions. Word has length 8 [2018-04-12 02:08:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:30,179 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 141 transitions. [2018-04-12 02:08:30,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 02:08:30,179 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2018-04-12 02:08:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-12 02:08:30,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:30,180 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:30,180 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:30,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1080483551, now seen corresponding path program 1 times [2018-04-12 02:08:30,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:30,180 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:30,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:30,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:30,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:30,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:30,231 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:30,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 02:08:30,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 02:08:30,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 02:08:30,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 02:08:30,233 INFO L87 Difference]: Start difference. First operand 134 states and 141 transitions. Second operand 4 states. [2018-04-12 02:08:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:30,365 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-04-12 02:08:30,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-12 02:08:30,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-12 02:08:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:30,367 INFO L225 Difference]: With dead ends: 150 [2018-04-12 02:08:30,367 INFO L226 Difference]: Without dead ends: 150 [2018-04-12 02:08:30,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-12 02:08:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-04-12 02:08:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-12 02:08:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-04-12 02:08:30,375 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 8 [2018-04-12 02:08:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:30,375 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-04-12 02:08:30,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 02:08:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-04-12 02:08:30,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 02:08:30,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:30,376 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:30,376 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:30,376 INFO L82 PathProgramCache]: Analyzing trace with hash -595612499, now seen corresponding path program 1 times [2018-04-12 02:08:30,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:30,376 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:30,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:30,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:30,378 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:30,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:30,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:30,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-12 02:08:30,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-12 02:08:30,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-12 02:08:30,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-12 02:08:30,437 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 4 states. [2018-04-12 02:08:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:30,558 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-04-12 02:08:30,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:08:30,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-12 02:08:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:30,559 INFO L225 Difference]: With dead ends: 146 [2018-04-12 02:08:30,559 INFO L226 Difference]: Without dead ends: 146 [2018-04-12 02:08:30,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-12 02:08:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-04-12 02:08:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-12 02:08:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-04-12 02:08:30,565 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 16 [2018-04-12 02:08:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:30,566 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-04-12 02:08:30,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-12 02:08:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-04-12 02:08:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-12 02:08:30,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:30,566 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:30,566 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:30,567 INFO L82 PathProgramCache]: Analyzing trace with hash -595612498, now seen corresponding path program 1 times [2018-04-12 02:08:30,567 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:30,567 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:30,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:30,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:30,568 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:30,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:30,626 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:30,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 02:08:30,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:08:30,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:08:30,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:30,626 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 5 states. [2018-04-12 02:08:30,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:30,767 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2018-04-12 02:08:30,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:08:30,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-12 02:08:30,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:30,768 INFO L225 Difference]: With dead ends: 174 [2018-04-12 02:08:30,768 INFO L226 Difference]: Without dead ends: 174 [2018-04-12 02:08:30,768 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 02:08:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-12 02:08:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 145. [2018-04-12 02:08:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-12 02:08:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-04-12 02:08:30,774 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 16 [2018-04-12 02:08:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:30,775 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-04-12 02:08:30,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:08:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-04-12 02:08:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 02:08:30,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:30,775 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:30,776 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961200, now seen corresponding path program 1 times [2018-04-12 02:08:30,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:30,776 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:30,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:30,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:30,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:30,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:30,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:30,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 02:08:30,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:08:30,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:08:30,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:30,818 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 5 states. [2018-04-12 02:08:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:30,962 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2018-04-12 02:08:30,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:08:30,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 02:08:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:30,963 INFO L225 Difference]: With dead ends: 203 [2018-04-12 02:08:30,963 INFO L226 Difference]: Without dead ends: 203 [2018-04-12 02:08:30,963 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 02:08:30,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-12 02:08:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 144. [2018-04-12 02:08:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-12 02:08:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2018-04-12 02:08:30,976 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 18 [2018-04-12 02:08:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:30,976 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2018-04-12 02:08:30,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:08:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2018-04-12 02:08:30,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-12 02:08:30,977 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:30,977 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:30,977 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:30,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1152961199, now seen corresponding path program 1 times [2018-04-12 02:08:30,977 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:30,977 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:30,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:30,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:30,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:30,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:31,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:31,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 02:08:31,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:08:31,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:08:31,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:31,031 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 5 states. [2018-04-12 02:08:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:31,200 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-04-12 02:08:31,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 02:08:31,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-12 02:08:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:31,201 INFO L225 Difference]: With dead ends: 227 [2018-04-12 02:08:31,201 INFO L226 Difference]: Without dead ends: 227 [2018-04-12 02:08:31,201 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 02:08:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-12 02:08:31,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2018-04-12 02:08:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-12 02:08:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-04-12 02:08:31,207 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 18 [2018-04-12 02:08:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:31,207 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-04-12 02:08:31,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:08:31,207 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-04-12 02:08:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 02:08:31,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:31,208 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:31,208 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009646, now seen corresponding path program 1 times [2018-04-12 02:08:31,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:31,209 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:31,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:31,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:31,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:31,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:31,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:31,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 02:08:31,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 02:08:31,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 02:08:31,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 02:08:31,286 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 9 states. [2018-04-12 02:08:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:31,543 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2018-04-12 02:08:31,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 02:08:31,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-12 02:08:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:31,544 INFO L225 Difference]: With dead ends: 157 [2018-04-12 02:08:31,544 INFO L226 Difference]: Without dead ends: 157 [2018-04-12 02:08:31,544 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-12 02:08:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-12 02:08:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2018-04-12 02:08:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-12 02:08:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-04-12 02:08:31,547 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 22 [2018-04-12 02:08:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:31,547 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-04-12 02:08:31,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 02:08:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-04-12 02:08:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-12 02:08:31,548 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:31,548 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:31,548 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:31,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1358009645, now seen corresponding path program 1 times [2018-04-12 02:08:31,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:31,549 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:31,550 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:31,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:31,550 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:31,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:31,641 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:31,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-12 02:08:31,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-12 02:08:31,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-12 02:08:31,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-12 02:08:31,642 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 10 states. [2018-04-12 02:08:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:32,037 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2018-04-12 02:08:32,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-12 02:08:32,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-12 02:08:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:32,039 INFO L225 Difference]: With dead ends: 162 [2018-04-12 02:08:32,039 INFO L226 Difference]: Without dead ends: 162 [2018-04-12 02:08:32,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-12 02:08:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-12 02:08:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 136. [2018-04-12 02:08:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-12 02:08:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-04-12 02:08:32,042 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 22 [2018-04-12 02:08:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:32,045 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-04-12 02:08:32,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-12 02:08:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-04-12 02:08:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-12 02:08:32,046 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:32,046 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:32,046 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash -582468992, now seen corresponding path program 1 times [2018-04-12 02:08:32,046 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:32,046 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:32,047 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:32,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:32,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:32,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:32,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:32,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 02:08:32,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:08:32,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:08:32,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:32,100 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 5 states. [2018-04-12 02:08:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:32,222 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2018-04-12 02:08:32,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:08:32,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-12 02:08:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:32,223 INFO L225 Difference]: With dead ends: 158 [2018-04-12 02:08:32,223 INFO L226 Difference]: Without dead ends: 158 [2018-04-12 02:08:32,223 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 02:08:32,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-12 02:08:32,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2018-04-12 02:08:32,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-12 02:08:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2018-04-12 02:08:32,225 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 28 [2018-04-12 02:08:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:32,225 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2018-04-12 02:08:32,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:08:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2018-04-12 02:08:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 02:08:32,226 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:32,226 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:32,226 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:32,226 INFO L82 PathProgramCache]: Analyzing trace with hash -863319961, now seen corresponding path program 1 times [2018-04-12 02:08:32,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:32,227 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:32,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:32,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:32,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:32,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:32,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:32,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 02:08:32,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:08:32,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:08:32,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:32,294 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand 5 states. [2018-04-12 02:08:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:32,397 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-04-12 02:08:32,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:08:32,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 02:08:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:32,399 INFO L225 Difference]: With dead ends: 147 [2018-04-12 02:08:32,399 INFO L226 Difference]: Without dead ends: 147 [2018-04-12 02:08:32,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-12 02:08:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-12 02:08:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2018-04-12 02:08:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-12 02:08:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 143 transitions. [2018-04-12 02:08:32,402 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 143 transitions. Word has length 29 [2018-04-12 02:08:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:32,402 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 143 transitions. [2018-04-12 02:08:32,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:08:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 143 transitions. [2018-04-12 02:08:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 02:08:32,405 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:32,405 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:32,405 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash 759542753, now seen corresponding path program 1 times [2018-04-12 02:08:32,405 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:32,406 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:32,407 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:32,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:32,407 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:32,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:32,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:32,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 02:08:32,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:08:32,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:08:32,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:32,456 INFO L87 Difference]: Start difference. First operand 135 states and 143 transitions. Second operand 5 states. [2018-04-12 02:08:32,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:32,610 INFO L93 Difference]: Finished difference Result 233 states and 248 transitions. [2018-04-12 02:08:32,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 02:08:32,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 02:08:32,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:32,611 INFO L225 Difference]: With dead ends: 233 [2018-04-12 02:08:32,611 INFO L226 Difference]: Without dead ends: 233 [2018-04-12 02:08:32,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-12 02:08:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-12 02:08:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 134. [2018-04-12 02:08:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-12 02:08:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-04-12 02:08:32,615 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 29 [2018-04-12 02:08:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:32,615 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-04-12 02:08:32,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:08:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-04-12 02:08:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-12 02:08:32,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:32,616 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:32,616 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash 759542752, now seen corresponding path program 1 times [2018-04-12 02:08:32,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:32,617 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:32,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:32,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:32,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:32,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:32,660 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:32,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-12 02:08:32,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:08:32,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:08:32,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:32,661 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 5 states. [2018-04-12 02:08:32,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:32,830 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-04-12 02:08:32,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-12 02:08:32,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-12 02:08:32,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:32,831 INFO L225 Difference]: With dead ends: 204 [2018-04-12 02:08:32,831 INFO L226 Difference]: Without dead ends: 204 [2018-04-12 02:08:32,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 02:08:32,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-12 02:08:32,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2018-04-12 02:08:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-12 02:08:32,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-04-12 02:08:32,834 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 29 [2018-04-12 02:08:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:32,834 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-04-12 02:08:32,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:08:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-04-12 02:08:32,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 02:08:32,834 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:32,834 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:32,834 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:32,835 INFO L82 PathProgramCache]: Analyzing trace with hash -375834398, now seen corresponding path program 1 times [2018-04-12 02:08:32,835 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:32,835 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:32,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:32,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:32,836 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:32,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:32,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:32,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-12 02:08:32,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-12 02:08:32,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-12 02:08:32,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-12 02:08:32,908 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 8 states. [2018-04-12 02:08:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:33,169 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-04-12 02:08:33,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-12 02:08:33,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-12 02:08:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:33,171 INFO L225 Difference]: With dead ends: 139 [2018-04-12 02:08:33,171 INFO L226 Difference]: Without dead ends: 139 [2018-04-12 02:08:33,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-12 02:08:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-12 02:08:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2018-04-12 02:08:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-12 02:08:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-04-12 02:08:33,174 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 33 [2018-04-12 02:08:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:33,174 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-04-12 02:08:33,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-12 02:08:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-04-12 02:08:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-12 02:08:33,177 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:33,177 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:33,177 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash -375834397, now seen corresponding path program 1 times [2018-04-12 02:08:33,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:33,177 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:33,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:33,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:33,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:33,194 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:33,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:33,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:33,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-12 02:08:33,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-12 02:08:33,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-12 02:08:33,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-12 02:08:33,295 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 9 states. [2018-04-12 02:08:33,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:33,539 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-04-12 02:08:33,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 02:08:33,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-12 02:08:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:33,540 INFO L225 Difference]: With dead ends: 136 [2018-04-12 02:08:33,540 INFO L226 Difference]: Without dead ends: 136 [2018-04-12 02:08:33,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-04-12 02:08:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-04-12 02:08:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2018-04-12 02:08:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-12 02:08:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-12 02:08:33,542 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 33 [2018-04-12 02:08:33,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:33,542 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-12 02:08:33,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-12 02:08:33,543 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-12 02:08:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-12 02:08:33,543 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:33,543 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:33,544 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:33,544 INFO L82 PathProgramCache]: Analyzing trace with hash -736807832, now seen corresponding path program 1 times [2018-04-12 02:08:33,544 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:33,544 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:33,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:33,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:33,545 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:33,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:33,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:33,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-12 02:08:33,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-12 02:08:33,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-12 02:08:33,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-12 02:08:33,606 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 5 states. [2018-04-12 02:08:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:33,686 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2018-04-12 02:08:33,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-12 02:08:33,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-04-12 02:08:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:33,686 INFO L225 Difference]: With dead ends: 138 [2018-04-12 02:08:33,686 INFO L226 Difference]: Without dead ends: 123 [2018-04-12 02:08:33,687 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-12 02:08:33,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-12 02:08:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-04-12 02:08:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-12 02:08:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-04-12 02:08:33,690 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 35 [2018-04-12 02:08:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:33,690 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-04-12 02:08:33,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-12 02:08:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-04-12 02:08:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 02:08:33,691 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:33,691 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:33,691 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:33,691 INFO L82 PathProgramCache]: Analyzing trace with hash -799952616, now seen corresponding path program 1 times [2018-04-12 02:08:33,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:33,691 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:33,692 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:33,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:33,693 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:33,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:33,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:08:33,887 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:08:33,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:33,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:08:33,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:33,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:33,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 02:08:33,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:33,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:33,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-12 02:08:34,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:34,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:34,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:34,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:34,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:34,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-12 02:08:34,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:34,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 43 [2018-04-12 02:08:34,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:34,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:34,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:34,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:34,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-12 02:08:34,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-12 02:08:34,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 02:08:34,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:34,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:34,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:34,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:82 [2018-04-12 02:08:34,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-04-12 02:08:34,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 02:08:34,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:34,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:34,368 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:34,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:34,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:34,374 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-12 02:08:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:34,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:08:34,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 28 [2018-04-12 02:08:34,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 02:08:34,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 02:08:34,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2018-04-12 02:08:34,460 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 29 states. [2018-04-12 02:08:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:35,777 INFO L93 Difference]: Finished difference Result 241 states and 255 transitions. [2018-04-12 02:08:35,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-12 02:08:35,777 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 49 [2018-04-12 02:08:35,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:35,778 INFO L225 Difference]: With dead ends: 241 [2018-04-12 02:08:35,778 INFO L226 Difference]: Without dead ends: 241 [2018-04-12 02:08:35,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=786, Invalid=2874, Unknown=0, NotChecked=0, Total=3660 [2018-04-12 02:08:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-12 02:08:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 156. [2018-04-12 02:08:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-04-12 02:08:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 167 transitions. [2018-04-12 02:08:35,783 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 167 transitions. Word has length 49 [2018-04-12 02:08:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:35,783 INFO L459 AbstractCegarLoop]: Abstraction has 156 states and 167 transitions. [2018-04-12 02:08:35,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 02:08:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 167 transitions. [2018-04-12 02:08:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-12 02:08:35,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:35,784 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:35,784 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:35,784 INFO L82 PathProgramCache]: Analyzing trace with hash -799952615, now seen corresponding path program 1 times [2018-04-12 02:08:35,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:35,784 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:35,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:35,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:35,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:35,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:36,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:08:36,042 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:08:36,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:36,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:08:36,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:36,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:36,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:08:36,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 02:08:36,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 02:08:36,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:36,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:36,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:36,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:36,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 02:08:36,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:36,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 64 [2018-04-12 02:08:36,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:36,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:36,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 02:08:36,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:36,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:36,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-12 02:08:36,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-12 02:08:36,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 02:08:36,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:36,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:36,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2018-04-12 02:08:36,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-12 02:08:36,494 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,502 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2018-04-12 02:08:36,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 02:08:36,520 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:36,536 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:36,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:36,564 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:121 [2018-04-12 02:08:36,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-04-12 02:08:36,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-04-12 02:08:36,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:36,687 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-12 02:08:36,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 02:08:36,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:36,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,711 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:36,714 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-12 02:08:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:36,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:08:36,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2018-04-12 02:08:36,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-12 02:08:36,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-12 02:08:36,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2018-04-12 02:08:36,785 INFO L87 Difference]: Start difference. First operand 156 states and 167 transitions. Second operand 28 states. [2018-04-12 02:08:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:38,084 INFO L93 Difference]: Finished difference Result 247 states and 264 transitions. [2018-04-12 02:08:38,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-12 02:08:38,084 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 49 [2018-04-12 02:08:38,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:38,085 INFO L225 Difference]: With dead ends: 247 [2018-04-12 02:08:38,085 INFO L226 Difference]: Without dead ends: 247 [2018-04-12 02:08:38,086 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=570, Invalid=2400, Unknown=0, NotChecked=0, Total=2970 [2018-04-12 02:08:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-12 02:08:38,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 158. [2018-04-12 02:08:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-12 02:08:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2018-04-12 02:08:38,089 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 49 [2018-04-12 02:08:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:38,089 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2018-04-12 02:08:38,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-12 02:08:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2018-04-12 02:08:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-12 02:08:38,090 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:38,090 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:38,090 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:38,091 INFO L82 PathProgramCache]: Analyzing trace with hash -7091430, now seen corresponding path program 1 times [2018-04-12 02:08:38,091 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:38,091 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:38,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:38,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:38,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:38,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:38,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:08:38,778 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:08:38,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:38,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:08:38,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:38,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:38,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:08:38,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:38,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 02:08:38,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:38,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:38,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-12 02:08:38,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:38,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:38,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:38,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:38,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:38,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:38,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:38,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:38,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:38,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-12 02:08:38,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:38,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 02:08:38,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:38,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:38,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:38,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:38,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-04-12 02:08:38,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:38,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:39,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-12 02:08:39,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-12 02:08:39,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 02:08:39,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:39,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:39,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-04-12 02:08:39,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 02:08:39,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:39,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:39,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2018-04-12 02:08:39,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 02:08:39,162 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,170 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:39,196 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:83, output treesize:129 [2018-04-12 02:08:39,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 3 [2018-04-12 02:08:39,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-12 02:08:39,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:39,267 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,268 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:39,276 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-04-12 02:08:39,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-12 02:08:39,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:39,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-04-12 02:08:39,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-12 02:08:39,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:39,384 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 02:08:39,388 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:39,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:39,394 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2018-04-12 02:08:39,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-12 02:08:39,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-12 02:08:39,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:39,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:39,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:39,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-12 02:08:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:39,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:08:39,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 39 [2018-04-12 02:08:39,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-12 02:08:39,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-12 02:08:39,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1362, Unknown=1, NotChecked=0, Total=1482 [2018-04-12 02:08:39,531 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 39 states. [2018-04-12 02:08:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:42,165 INFO L93 Difference]: Finished difference Result 245 states and 261 transitions. [2018-04-12 02:08:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 02:08:42,165 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2018-04-12 02:08:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:42,165 INFO L225 Difference]: With dead ends: 245 [2018-04-12 02:08:42,166 INFO L226 Difference]: Without dead ends: 245 [2018-04-12 02:08:42,166 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=594, Invalid=3694, Unknown=2, NotChecked=0, Total=4290 [2018-04-12 02:08:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-04-12 02:08:42,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 155. [2018-04-12 02:08:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-12 02:08:42,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2018-04-12 02:08:42,168 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 53 [2018-04-12 02:08:42,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:42,169 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2018-04-12 02:08:42,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-12 02:08:42,169 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2018-04-12 02:08:42,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 02:08:42,169 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:42,169 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:42,169 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:42,169 INFO L82 PathProgramCache]: Analyzing trace with hash -698335515, now seen corresponding path program 1 times [2018-04-12 02:08:42,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:42,169 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:42,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:42,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:42,170 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:42,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:42,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:08:42,398 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:08:42,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:42,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:08:42,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:42,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:42,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:08:42,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-12 02:08:42,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:42,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:42,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-12 02:08:42,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-12 02:08:42,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:42,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:42,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-12 02:08:42,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-12 02:08:42,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 02:08:42,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:42,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:42,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:42,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:76 [2018-04-12 02:08:42,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:42,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:42,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:42,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:42,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 02:08:42,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2018-04-12 02:08:42,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:42,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-12 02:08:42,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-12 02:08:42,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:37 [2018-04-12 02:08:42,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:42,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-04-12 02:08:42,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:42,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:42,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-12 02:08:42,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71 [2018-04-12 02:08:42,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-04-12 02:08:42,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:42,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:42,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:42,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:144 [2018-04-12 02:08:42,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 43 [2018-04-12 02:08:42,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:42,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-12 02:08:42,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-12 02:08:42,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:42,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:5 [2018-04-12 02:08:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:43,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:08:43,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 31 [2018-04-12 02:08:43,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-12 02:08:43,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-12 02:08:43,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-04-12 02:08:43,022 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 32 states. [2018-04-12 02:08:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:44,361 INFO L93 Difference]: Finished difference Result 313 states and 332 transitions. [2018-04-12 02:08:44,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-12 02:08:44,361 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2018-04-12 02:08:44,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:44,362 INFO L225 Difference]: With dead ends: 313 [2018-04-12 02:08:44,362 INFO L226 Difference]: Without dead ends: 313 [2018-04-12 02:08:44,363 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=502, Invalid=3038, Unknown=0, NotChecked=0, Total=3540 [2018-04-12 02:08:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-12 02:08:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 189. [2018-04-12 02:08:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-12 02:08:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2018-04-12 02:08:44,365 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 58 [2018-04-12 02:08:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:44,365 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2018-04-12 02:08:44,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-12 02:08:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2018-04-12 02:08:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 02:08:44,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:44,366 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:44,366 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:44,366 INFO L82 PathProgramCache]: Analyzing trace with hash -698335514, now seen corresponding path program 1 times [2018-04-12 02:08:44,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:44,366 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:44,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:44,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:44,367 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:44,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:44,657 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:08:44,657 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:08:44,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:44,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:08:44,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:44,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:44,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:08:44,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 02:08:44,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:44,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:44,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:44,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:44,729 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,741 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-12 02:08:44,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:44,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-12 02:08:44,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:44,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 02:08:44,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:44,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:44,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:44,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-12 02:08:44,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-12 02:08:44,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 02:08:44,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:44,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:45,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-04-12 02:08:45,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-04-12 02:08:45,003 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 68 [2018-04-12 02:08:45,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-12 02:08:45,021 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:45,033 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:45,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:45,057 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:137 [2018-04-12 02:08:45,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:45,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-12 02:08:45,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:45,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:45,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:45,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:45,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 02:08:45,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2018-04-12 02:08:45,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-04-12 02:08:45,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-12 02:08:45,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:45,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2018-04-12 02:08:45,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-12 02:08:45,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:62 [2018-04-12 02:08:45,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 02:08:45,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:45,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:45,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 86 [2018-04-12 02:08:45,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:45,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:45,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:88 [2018-04-12 02:08:45,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-04-12 02:08:45,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-04-12 02:08:45,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:45,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:45,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 105 [2018-04-12 02:08:45,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-04-12 02:08:45,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 113 [2018-04-12 02:08:45,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-04-12 02:08:45,528 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:45,546 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:45,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:45,578 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:163, output treesize:241 [2018-04-12 02:08:45,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 61 [2018-04-12 02:08:45,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-04-12 02:08:45,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:45,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:45,746 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-12 02:08:45,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:45,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-12 02:08:45,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:45,774 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 02:08:45,778 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,779 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:45,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:45,787 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:115, output treesize:18 [2018-04-12 02:08:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:45,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:08:45,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2018-04-12 02:08:45,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-12 02:08:45,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-12 02:08:45,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1286, Unknown=0, NotChecked=0, Total=1406 [2018-04-12 02:08:45,897 INFO L87 Difference]: Start difference. First operand 189 states and 202 transitions. Second operand 38 states. [2018-04-12 02:08:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:48,390 INFO L93 Difference]: Finished difference Result 321 states and 344 transitions. [2018-04-12 02:08:48,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-12 02:08:48,391 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 58 [2018-04-12 02:08:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:48,393 INFO L225 Difference]: With dead ends: 321 [2018-04-12 02:08:48,393 INFO L226 Difference]: Without dead ends: 321 [2018-04-12 02:08:48,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=488, Invalid=3802, Unknown=0, NotChecked=0, Total=4290 [2018-04-12 02:08:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-12 02:08:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 191. [2018-04-12 02:08:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-12 02:08:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 204 transitions. [2018-04-12 02:08:48,401 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 204 transitions. Word has length 58 [2018-04-12 02:08:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:48,402 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 204 transitions. [2018-04-12 02:08:48,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-12 02:08:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 204 transitions. [2018-04-12 02:08:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-12 02:08:48,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:48,403 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:48,403 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:48,403 INFO L82 PathProgramCache]: Analyzing trace with hash -611631047, now seen corresponding path program 1 times [2018-04-12 02:08:48,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:48,403 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:48,404 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:48,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:48,405 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:48,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-12 02:08:48,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-12 02:08:48,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-12 02:08:48,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-12 02:08:48,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-12 02:08:48,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-12 02:08:48,490 INFO L87 Difference]: Start difference. First operand 191 states and 204 transitions. Second operand 6 states. [2018-04-12 02:08:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:48,633 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-04-12 02:08:48,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-12 02:08:48,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-04-12 02:08:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:48,635 INFO L225 Difference]: With dead ends: 155 [2018-04-12 02:08:48,635 INFO L226 Difference]: Without dead ends: 155 [2018-04-12 02:08:48,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-12 02:08:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-12 02:08:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2018-04-12 02:08:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-12 02:08:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-04-12 02:08:48,642 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 58 [2018-04-12 02:08:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:48,642 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-04-12 02:08:48,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-12 02:08:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-04-12 02:08:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-12 02:08:48,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:48,643 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:48,643 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:48,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1513085733, now seen corresponding path program 2 times [2018-04-12 02:08:48,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:48,644 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:48,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:48,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:48,645 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:48,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:48,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:08:48,873 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:08:48,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 02:08:48,899 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 02:08:48,900 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 02:08:48,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:08:48,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:48,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:48,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:08:48,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:48,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:48,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 02:08:48,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:49,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:49,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-12 02:08:49,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:49,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-12 02:08:49,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:49,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:49,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-12 02:08:49,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-04-12 02:08:49,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-04-12 02:08:49,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:49,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:49,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-12 02:08:49,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 02:08:49,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-04-12 02:08:49,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-12 02:08:49,202 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,208 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:49,224 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:98 [2018-04-12 02:08:49,406 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:08:49,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-04-12 02:08:49,434 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:08:49,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2018-04-12 02:08:49,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:49,446 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:08:49,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-12 02:08:49,447 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:49,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-12 02:08:49,463 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:08:49,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-12 02:08:49,464 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:49,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-12 02:08:49,469 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:49,475 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:7 [2018-04-12 02:08:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:49,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:08:49,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 29 [2018-04-12 02:08:49,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-12 02:08:49,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-12 02:08:49,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=725, Unknown=3, NotChecked=0, Total=812 [2018-04-12 02:08:49,505 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 29 states. [2018-04-12 02:08:50,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:50,177 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2018-04-12 02:08:50,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-12 02:08:50,177 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 59 [2018-04-12 02:08:50,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:50,177 INFO L225 Difference]: With dead ends: 167 [2018-04-12 02:08:50,177 INFO L226 Difference]: Without dead ends: 142 [2018-04-12 02:08:50,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1741, Unknown=3, NotChecked=0, Total=2070 [2018-04-12 02:08:50,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-12 02:08:50,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 129. [2018-04-12 02:08:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-12 02:08:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-04-12 02:08:50,180 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 59 [2018-04-12 02:08:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:50,180 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-04-12 02:08:50,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-12 02:08:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-04-12 02:08:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 02:08:50,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:50,180 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:50,181 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash 484223591, now seen corresponding path program 1 times [2018-04-12 02:08:50,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:50,181 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:50,181 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:50,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 02:08:50,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:50,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:50,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:08:50,477 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:08:50,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:50,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:08:50,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:50,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:50,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:08:50,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 02:08:50,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:50,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:50,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:50,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:50,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-12 02:08:50,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:50,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 55 [2018-04-12 02:08:50,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:50,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 02:08:50,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:50,609 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:50,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-12 02:08:50,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-04-12 02:08:50,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-04-12 02:08:50,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:50,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:50,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 73 [2018-04-12 02:08:50,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-12 02:08:50,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:50,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:50,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 69 [2018-04-12 02:08:50,788 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:08:50,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-04-12 02:08:50,790 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,802 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:50,828 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:155 [2018-04-12 02:08:50,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:50,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:50,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:50,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:50,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-12 02:08:50,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:83 [2018-04-12 02:08:50,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:50,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-12 02:08:50,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-04-12 02:08:50,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-04-12 02:08:50,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-04-12 02:08:50,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:50,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:81 [2018-04-12 02:08:51,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:51,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:51,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:51,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 120 [2018-04-12 02:08:51,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:51,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-04-12 02:08:51,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:51,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:51,092 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:99 [2018-04-12 02:08:51,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 144 [2018-04-12 02:08:51,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-04-12 02:08:51,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:51,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:51,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 156 [2018-04-12 02:08:51,294 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:08:51,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 48 [2018-04-12 02:08:51,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,307 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:08:51,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 141 [2018-04-12 02:08:51,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-04-12 02:08:51,311 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,320 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:51,348 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:203, output treesize:289 [2018-04-12 02:08:51,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2018-04-12 02:08:51,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:51,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 60 [2018-04-12 02:08:51,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:51,493 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2018-04-12 02:08:51,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 50 [2018-04-12 02:08:51,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-12 02:08:51,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:51,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-12 02:08:51,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:51,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:51,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:51,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:51,586 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2018-04-12 02:08:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:51,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:08:51,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-04-12 02:08:51,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-12 02:08:51,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-12 02:08:51,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1386, Unknown=0, NotChecked=0, Total=1560 [2018-04-12 02:08:51,678 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 40 states. [2018-04-12 02:08:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:53,171 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2018-04-12 02:08:53,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-12 02:08:53,171 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 62 [2018-04-12 02:08:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:53,171 INFO L225 Difference]: With dead ends: 179 [2018-04-12 02:08:53,172 INFO L226 Difference]: Without dead ends: 179 [2018-04-12 02:08:53,172 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=508, Invalid=3524, Unknown=0, NotChecked=0, Total=4032 [2018-04-12 02:08:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-12 02:08:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 131. [2018-04-12 02:08:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-12 02:08:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-04-12 02:08:53,174 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 62 [2018-04-12 02:08:53,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:53,174 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-04-12 02:08:53,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-12 02:08:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-04-12 02:08:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-12 02:08:53,175 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:53,175 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:53,175 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash 484223592, now seen corresponding path program 1 times [2018-04-12 02:08:53,175 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:53,175 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:53,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:53,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:53,176 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:53,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:53,582 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:08:53,582 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:08:53,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:53,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:08:53,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:53,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:53,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:08:53,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-12 02:08:53,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:53,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:53,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:53,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:53,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-04-12 02:08:53,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-12 02:08:53,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:53,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-04-12 02:08:53,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:53,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:53,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-04-12 02:08:53,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2018-04-12 02:08:53,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 39 [2018-04-12 02:08:53,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:53,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:53,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-04-12 02:08:53,801 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:08:53,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2018-04-12 02:08:53,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-04-12 02:08:53,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-12 02:08:53,826 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:53,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:53,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:53,862 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:141 [2018-04-12 02:08:53,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-12 02:08:53,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:53,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:53,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:53,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:53,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 02:08:53,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-04-12 02:08:53,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:53,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-04-12 02:08:53,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-12 02:08:53,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:53,993 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:08:53,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 56 [2018-04-12 02:08:53,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-12 02:08:53,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,008 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:75 [2018-04-12 02:08:54,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:54,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:54,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:54,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 126 [2018-04-12 02:08:54,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:54,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:54,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 90 [2018-04-12 02:08:54,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:54,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:54,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:117, output treesize:97 [2018-04-12 02:08:54,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 150 [2018-04-12 02:08:54,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-04-12 02:08:54,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:54,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:54,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 135 [2018-04-12 02:08:54,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-12 02:08:54,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 155 [2018-04-12 02:08:54,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-04-12 02:08:54,332 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:54,347 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:54,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:54,377 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:197, output treesize:281 [2018-04-12 02:08:54,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 98 [2018-04-12 02:08:54,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2018-04-12 02:08:54,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:54,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-04-12 02:08:54,584 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:54,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:54,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-04-12 02:08:54,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:54,604 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-12 02:08:54,609 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,610 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:54,614 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2018-04-12 02:08:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:54,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:08:54,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 35 [2018-04-12 02:08:54,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-12 02:08:54,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-12 02:08:54,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2018-04-12 02:08:54,674 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 36 states. [2018-04-12 02:08:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:56,393 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-04-12 02:08:56,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-12 02:08:56,393 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2018-04-12 02:08:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:56,394 INFO L225 Difference]: With dead ends: 177 [2018-04-12 02:08:56,394 INFO L226 Difference]: Without dead ends: 177 [2018-04-12 02:08:56,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=334, Invalid=2972, Unknown=0, NotChecked=0, Total=3306 [2018-04-12 02:08:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-12 02:08:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2018-04-12 02:08:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-12 02:08:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2018-04-12 02:08:56,396 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 62 [2018-04-12 02:08:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:56,396 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2018-04-12 02:08:56,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-12 02:08:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2018-04-12 02:08:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 02:08:56,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:56,396 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:56,397 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:56,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400824, now seen corresponding path program 3 times [2018-04-12 02:08:56,397 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:56,397 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:56,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:56,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-12 02:08:56,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:56,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:56,762 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:08:56,762 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:08:56,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-12 02:08:56,808 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-12 02:08:56,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 02:08:56,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:08:56,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:56,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:56,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-12 02:08:56,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:56,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:56,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-12 02:08:56,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:56,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:56,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:56,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:56,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:56,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-04-12 02:08:56,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:56,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-12 02:08:56,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:56,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:56,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:56,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:56,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-12 02:08:56,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-12 02:08:56,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-12 02:08:56,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:56,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:56,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:56,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:82 [2018-04-12 02:08:57,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:57,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:57,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:57,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:57,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-12 02:08:57,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2018-04-12 02:08:57,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:57,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-12 02:08:57,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-12 02:08:57,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:35 [2018-04-12 02:08:57,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:57,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-04-12 02:08:57,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:57,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:57,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-12 02:08:57,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71 [2018-04-12 02:08:57,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-04-12 02:08:57,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:08:57,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:08:57,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-12 02:08:57,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:150 [2018-04-12 02:08:57,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2018-04-12 02:08:57,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:08:57,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,440 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:08:57,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-12 02:08:57,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-12 02:08:57,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:57,452 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:5 [2018-04-12 02:08:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:57,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:08:57,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 38 [2018-04-12 02:08:57,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-12 02:08:57,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-12 02:08:57,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2018-04-12 02:08:57,494 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand 39 states. [2018-04-12 02:08:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:08:59,200 INFO L93 Difference]: Finished difference Result 216 states and 225 transitions. [2018-04-12 02:08:59,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-12 02:08:59,201 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 63 [2018-04-12 02:08:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:08:59,202 INFO L225 Difference]: With dead ends: 216 [2018-04-12 02:08:59,202 INFO L226 Difference]: Without dead ends: 216 [2018-04-12 02:08:59,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=662, Invalid=3760, Unknown=0, NotChecked=0, Total=4422 [2018-04-12 02:08:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-12 02:08:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 166. [2018-04-12 02:08:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-12 02:08:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 176 transitions. [2018-04-12 02:08:59,206 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 176 transitions. Word has length 63 [2018-04-12 02:08:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:08:59,206 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 176 transitions. [2018-04-12 02:08:59,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-12 02:08:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2018-04-12 02:08:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-12 02:08:59,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:08:59,207 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:08:59,207 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:08:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1042400823, now seen corresponding path program 2 times [2018-04-12 02:08:59,207 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:08:59,207 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:08:59,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:59,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 02:08:59,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:08:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-12 02:08:59,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-12 02:08:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:08:59,607 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-12 02:08:59,607 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-12 02:08:59,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-12 02:08:59,659 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-12 02:08:59,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-12 02:08:59,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-12 02:08:59,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:59,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:59,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-12 02:08:59,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2018-04-12 02:08:59,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:59,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:59,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-12 02:08:59,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-12 02:08:59,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:43 [2018-04-12 02:08:59,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:59,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-12 02:08:59,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:59,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:59,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-04-12 02:08:59,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:08:59,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:08:59,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:08:59,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:85, output treesize:69 [2018-04-12 02:08:59,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-04-12 02:08:59,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:08:59,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 35 [2018-04-12 02:08:59,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:09:00,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:09:00,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,062 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:00,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-04-12 02:09:00,067 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:00,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-12 02:09:00,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 92 [2018-04-12 02:09:00,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,088 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:00,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 54 [2018-04-12 02:09:00,088 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-12 02:09:00,131 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:102, output treesize:185 [2018-04-12 02:09:00,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-04-12 02:09:00,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-12 02:09:00,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:86 [2018-04-12 02:09:00,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 72 [2018-04-12 02:09:00,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2018-04-12 02:09:00,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,325 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:00,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2018-04-12 02:09:00,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-04-12 02:09:00,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:96 [2018-04-12 02:09:00,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 141 [2018-04-12 02:09:00,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:09:00,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 101 [2018-04-12 02:09:00,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-12 02:09:00,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:00,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:138, output treesize:114 [2018-04-12 02:09:00,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 173 [2018-04-12 02:09:00,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 51 [2018-04-12 02:09:00,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-12 02:09:00,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-12 02:09:00,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,698 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:00,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 162 [2018-04-12 02:09:00,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-04-12 02:09:00,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 177 [2018-04-12 02:09:00,724 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:00,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 48 [2018-04-12 02:09:00,724 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,741 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-12 02:09:00,775 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:218, output treesize:319 [2018-04-12 02:09:00,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-12 02:09:00,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 107 [2018-04-12 02:09:00,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-12 02:09:00,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,988 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:00,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-12 02:09:00,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:00,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2018-04-12 02:09:00,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:01,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-12 02:09:01,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-04-12 02:09:01,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-12 02:09:01,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:01,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-12 02:09:01,027 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:01,031 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 02:09:01,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-12 02:09:01,031 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-12 02:09:01,033 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 02:09:01,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 02:09:01,047 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:153, output treesize:20 [2018-04-12 02:09:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-12 02:09:01,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-12 02:09:01,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 43 [2018-04-12 02:09:01,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-12 02:09:01,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-12 02:09:01,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1680, Unknown=0, NotChecked=0, Total=1892 [2018-04-12 02:09:01,146 INFO L87 Difference]: Start difference. First operand 166 states and 176 transitions. Second operand 44 states. [2018-04-12 02:09:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-12 02:09:03,354 INFO L93 Difference]: Finished difference Result 214 states and 226 transitions. [2018-04-12 02:09:03,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-12 02:09:03,354 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2018-04-12 02:09:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-12 02:09:03,355 INFO L225 Difference]: With dead ends: 214 [2018-04-12 02:09:03,355 INFO L226 Difference]: Without dead ends: 214 [2018-04-12 02:09:03,356 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=735, Invalid=4667, Unknown=0, NotChecked=0, Total=5402 [2018-04-12 02:09:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-12 02:09:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 168. [2018-04-12 02:09:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-12 02:09:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-04-12 02:09:03,358 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 63 [2018-04-12 02:09:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-12 02:09:03,358 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-04-12 02:09:03,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-12 02:09:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-04-12 02:09:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-12 02:09:03,359 INFO L347 BasicCegarLoop]: Found error trace [2018-04-12 02:09:03,359 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-12 02:09:03,359 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr52AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr58EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr53AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-12 02:09:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1290037367, now seen corresponding path program 1 times [2018-04-12 02:09:03,359 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-12 02:09:03,359 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-12 02:09:03,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:03,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-12 02:09:03,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-12 02:09:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-12 02:09:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-12 02:09:03,416 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-12 02:09:03,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 02:09:03 BoogieIcfgContainer [2018-04-12 02:09:03,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 02:09:03,450 INFO L168 Benchmark]: Toolchain (without parser) took 34471.01 ms. Allocated memory was 449.3 MB in the beginning and 1.6 GB in the end (delta: 1.1 GB). Free memory was 384.3 MB in the beginning and 442.9 MB in the end (delta: -58.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-04-12 02:09:03,451 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 449.3 MB. Free memory is still 412.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 02:09:03,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.97 ms. Allocated memory is still 449.3 MB. Free memory was 384.3 MB in the beginning and 351.3 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. [2018-04-12 02:09:03,452 INFO L168 Benchmark]: Boogie Preprocessor took 44.54 ms. Allocated memory is still 449.3 MB. Free memory is still 351.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 02:09:03,452 INFO L168 Benchmark]: RCFGBuilder took 526.59 ms. Allocated memory was 449.3 MB in the beginning and 518.0 MB in the end (delta: 68.7 MB). Free memory was 351.3 MB in the beginning and 429.8 MB in the end (delta: -78.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 5.3 GB. [2018-04-12 02:09:03,452 INFO L168 Benchmark]: TraceAbstraction took 33644.31 ms. Allocated memory was 518.0 MB in the beginning and 1.6 GB in the end (delta: 1.1 GB). Free memory was 424.6 MB in the beginning and 442.9 MB in the end (delta: -18.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-04-12 02:09:03,453 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.17 ms. Allocated memory is still 449.3 MB. Free memory is still 412.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 252.97 ms. Allocated memory is still 449.3 MB. Free memory was 384.3 MB in the beginning and 351.3 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.54 ms. Allocated memory is still 449.3 MB. Free memory is still 351.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 526.59 ms. Allocated memory was 449.3 MB in the beginning and 518.0 MB in the end (delta: 68.7 MB). Free memory was 351.3 MB in the beginning and 429.8 MB in the end (delta: -78.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 33644.31 ms. Allocated memory was 518.0 MB in the beginning and 1.6 GB in the end (delta: 1.1 GB). Free memory was 424.6 MB in the beginning and 442.9 MB in the end (delta: -18.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={16:0}] [L994] SLL* list = malloc(sizeof(SLL)); VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L995] FCALL list->next = ((void*)0) VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L996] FCALL list->prev = ((void*)0) VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L997] FCALL list->colour = BLACK VAL [list={16:0}, malloc(sizeof(SLL))={16:0}] [L999] SLL* end = list; VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={16:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1005] FCALL end->next = malloc(sizeof(SLL)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1006] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1006] FCALL end->next->prev = end VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1007] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1007] end = end->next [L1008] FCALL end->next = ((void*)0) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1016] FCALL end->colour = RED VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={16:0}] [L1017] EXPR, FCALL malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1017] FCALL end->next = malloc(sizeof(SLL)) VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1018] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1018] FCALL end->next->prev = end VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1019] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1019] end = end->next [L1020] FCALL end->next = ((void*)0) VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1021] FCALL end->colour = BLACK VAL [end={15:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1029] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1030] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1030] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1032] COND TRUE ((void*)0) != end VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1034] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=1, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1040] COND FALSE !(!(end->next)) [L1040] COND FALSE !(0) VAL [end={16:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1041] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1041] end = end->next [L1032] COND TRUE ((void*)0) != end VAL [end={14:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1034] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=0, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1036] end = end->next [L1037] EXPR, FCALL end->next VAL [end={15:0}, end->next={0:0}, list={16:0}, malloc(sizeof(SLL))={14:0}, malloc(sizeof(SLL))={15:0}, malloc(sizeof(SLL))={16:0}] [L1037] end = end->next [L1040] FCALL end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 59 error locations. UNSAFE Result, 33.6s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 19.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2050 SDtfs, 8711 SDslu, 11873 SDs, 0 SdLazy, 19788 SolverSat, 1418 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1178 GetRequests, 439 SyntacticMatches, 31 SemanticMatches, 708 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9301 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 1220 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 1619 NumberOfCodeBlocks, 1619 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1518 ConstructedInterpolants, 297 QuantifiedInterpolants, 2351231 SizeOfPredicates, 190 NumberOfNonLiveVariables, 2196 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 36 InterpolantComputations, 16 PerfectInterpolantSequences, 26/228 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_02-09-03-459.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_02-09-03-459.csv Received shutdown request...