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-sorted_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 12:23:13,042 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 12:23:13,043 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 12:23:13,055 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 12:23:13,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 12:23:13,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 12:23:13,056 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 12:23:13,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 12:23:13,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 12:23:13,060 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 12:23:13,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 12:23:13,061 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 12:23:13,062 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 12:23:13,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 12:23:13,063 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 12:23:13,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 12:23:13,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 12:23:13,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 12:23:13,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 12:23:13,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 12:23:13,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 12:23:13,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 12:23:13,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 12:23:13,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 12:23:13,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 12:23:13,074 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 12:23:13,074 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 12:23:13,074 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 12:23:13,075 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 12:23:13,075 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 12:23:13,076 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 12:23:13,076 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 12:23:13,097 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 12:23:13,097 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 12:23:13,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 12:23:13,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 12:23:13,098 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 12:23:13,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 12:23:13,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 12:23:13,099 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 12:23:13,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 12:23:13,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 12:23:13,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 12:23:13,099 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 12:23:13,099 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 12:23:13,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 12:23:13,099 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 12:23:13,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 12:23:13,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 12:23:13,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 12:23:13,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 12:23:13,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 12:23:13,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 12:23:13,100 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 12:23:13,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 12:23:13,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 12:23:13,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 12:23:13,134 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 12:23:13,137 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 12:23:13,138 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 12:23:13,138 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 12:23:13,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,422 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc0b9b9cb6 [2018-04-11 12:23:13,588 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 12:23:13,588 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 12:23:13,588 INFO L168 CDTParser]: Scanning dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,597 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 12:23:13,597 INFO L215 ultiparseSymbolTable]: [2018-04-11 12:23:13,597 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 12:23:13,597 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,597 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 12:23:13,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____time_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____timer_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,597 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__size_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,598 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ino_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_short in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__mode_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,599 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__time_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__div_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__off_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__gid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_short in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____mode_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,600 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____dev_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fd_set in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__register_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,601 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____key_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__loff_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____clock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,602 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____pid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ino_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ushort in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____loff_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__clock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_long in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____off_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ulong in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,603 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__SLL in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_int in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_char in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__quad_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__id_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,604 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_long in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__dev_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____off64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__int16_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____u_char in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,605 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__uid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__uint in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,606 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,607 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,607 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__timer_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,607 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,607 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,607 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____id_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,607 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,607 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__u_int in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,607 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,607 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i____gid_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,607 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_sorted_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:13,621 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc0b9b9cb6 [2018-04-11 12:23:13,623 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 12:23:13,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 12:23:13,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 12:23:13,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 12:23:13,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 12:23:13,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:23:13" (1/1) ... [2018-04-11 12:23:13,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136c4a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13, skipping insertion in model container [2018-04-11 12:23:13,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:23:13" (1/1) ... [2018-04-11 12:23:13,642 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:23:13,668 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:23:13,794 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:23:13,832 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:23:13,838 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 12:23:13,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13 WrapperNode [2018-04-11 12:23:13,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 12:23:13,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 12:23:13,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 12:23:13,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 12:23:13,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13" (1/1) ... [2018-04-11 12:23:13,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13" (1/1) ... [2018-04-11 12:23:13,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13" (1/1) ... [2018-04-11 12:23:13,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13" (1/1) ... [2018-04-11 12:23:13,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13" (1/1) ... [2018-04-11 12:23:13,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13" (1/1) ... [2018-04-11 12:23:13,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13" (1/1) ... [2018-04-11 12:23:13,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 12:23:13,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 12:23:13,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 12:23:13,925 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 12:23:13,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 12:23:14,005 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 12:23:14,006 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 12:23:14,006 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 12:23:14,006 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 12:23:14,006 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 12:23:14,006 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 12:23:14,006 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 12:23:14,006 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 12:23:14,006 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 12:23:14,006 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 12:23:14,006 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 12:23:14,007 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 12:23:14,007 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 12:23:14,007 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 12:23:14,007 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 12:23:14,007 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 12:23:14,007 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 12:23:14,007 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 12:23:14,007 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 12:23:14,007 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 12:23:14,008 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 12:23:14,008 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 12:23:14,008 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 12:23:14,008 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 12:23:14,008 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 12:23:14,008 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 12:23:14,008 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 12:23:14,008 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 12:23:14,009 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 12:23:14,009 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 12:23:14,009 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 12:23:14,009 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 12:23:14,009 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 12:23:14,009 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 12:23:14,009 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 12:23:14,009 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 12:23:14,009 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 12:23:14,010 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 12:23:14,010 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 12:23:14,010 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 12:23:14,010 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 12:23:14,010 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 12:23:14,010 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 12:23:14,010 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 12:23:14,010 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 12:23:14,010 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 12:23:14,010 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 12:23:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 12:23:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 12:23:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 12:23:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 12:23:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 12:23:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 12:23:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 12:23:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 12:23:14,011 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 12:23:14,012 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 12:23:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 12:23:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 12:23:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 12:23:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 12:23:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 12:23:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 12:23:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 12:23:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 12:23:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 12:23:14,013 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 12:23:14,014 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 12:23:14,014 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 12:23:14,014 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 12:23:14,014 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 12:23:14,014 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 12:23:14,014 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 12:23:14,014 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 12:23:14,014 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 12:23:14,014 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 12:23:14,014 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 12:23:14,015 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 12:23:14,016 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 12:23:14,016 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 12:23:14,016 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 12:23:14,016 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 12:23:14,016 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 12:23:14,016 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 12:23:14,016 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 12:23:14,016 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 12:23:14,016 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 12:23:14,016 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 12:23:14,017 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 12:23:14,017 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 12:23:14,017 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 12:23:14,017 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 12:23:14,017 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 12:23:14,017 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 12:23:14,017 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 12:23:14,017 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 12:23:14,017 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 12:23:14,017 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 12:23:14,488 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 12:23:14,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:23:14 BoogieIcfgContainer [2018-04-11 12:23:14,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 12:23:14,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 12:23:14,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 12:23:14,491 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 12:23:14,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 12:23:13" (1/3) ... [2018-04-11 12:23:14,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209d4802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:23:14, skipping insertion in model container [2018-04-11 12:23:14,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:23:13" (2/3) ... [2018-04-11 12:23:14,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209d4802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:23:14, skipping insertion in model container [2018-04-11 12:23:14,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:23:14" (3/3) ... [2018-04-11 12:23:14,493 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-sorted_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:23:14,499 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 12:23:14,504 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-04-11 12:23:14,534 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 12:23:14,534 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 12:23:14,534 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 12:23:14,534 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 12:23:14,534 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 12:23:14,535 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 12:23:14,535 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 12:23:14,535 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 12:23:14,535 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 12:23:14,535 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 12:23:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2018-04-11 12:23:14,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:23:14,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:23:14,555 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:23:14,555 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:23:14,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1591934807, now seen corresponding path program 1 times [2018-04-11 12:23:14,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:23:14,558 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:23:14,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:14,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:14,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:14,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:23:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:14,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:23:14,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:23:14,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:23:14,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:23:14,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:23:14,691 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 4 states. [2018-04-11 12:23:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:23:14,873 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-04-11 12:23:14,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:23:14,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:23:14,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:23:14,883 INFO L225 Difference]: With dead ends: 197 [2018-04-11 12:23:14,884 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 12:23:14,885 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:23:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 12:23:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2018-04-11 12:23:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-11 12:23:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2018-04-11 12:23:14,918 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 8 [2018-04-11 12:23:14,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:23:14,918 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2018-04-11 12:23:14,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:23:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2018-04-11 12:23:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:23:14,919 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:23:14,919 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:23:14,919 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:23:14,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1591934808, now seen corresponding path program 1 times [2018-04-11 12:23:14,919 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:23:14,919 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:23:14,920 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:14,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:14,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:14,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:23:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:14,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:23:14,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:23:14,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:23:14,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:23:14,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:23:14,966 INFO L87 Difference]: Start difference. First operand 179 states and 190 transitions. Second operand 4 states. [2018-04-11 12:23:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:23:15,069 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2018-04-11 12:23:15,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:23:15,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:23:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:23:15,070 INFO L225 Difference]: With dead ends: 181 [2018-04-11 12:23:15,070 INFO L226 Difference]: Without dead ends: 181 [2018-04-11 12:23:15,071 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:23:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-11 12:23:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2018-04-11 12:23:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 12:23:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 187 transitions. [2018-04-11 12:23:15,079 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 187 transitions. Word has length 8 [2018-04-11 12:23:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:23:15,079 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 187 transitions. [2018-04-11 12:23:15,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:23:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 187 transitions. [2018-04-11 12:23:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 12:23:15,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:23:15,080 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:23:15,080 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:23:15,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1438606308, now seen corresponding path program 1 times [2018-04-11 12:23:15,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:23:15,080 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:23:15,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:15,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:15,082 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:15,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:23:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:15,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:23:15,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:23:15,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:23:15,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:23:15,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:23:15,147 INFO L87 Difference]: Start difference. First operand 176 states and 187 transitions. Second operand 4 states. [2018-04-11 12:23:15,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:23:15,258 INFO L93 Difference]: Finished difference Result 186 states and 200 transitions. [2018-04-11 12:23:15,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:23:15,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 12:23:15,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:23:15,259 INFO L225 Difference]: With dead ends: 186 [2018-04-11 12:23:15,259 INFO L226 Difference]: Without dead ends: 186 [2018-04-11 12:23:15,260 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:23:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-11 12:23:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 175. [2018-04-11 12:23:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-11 12:23:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2018-04-11 12:23:15,267 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 16 [2018-04-11 12:23:15,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:23:15,268 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2018-04-11 12:23:15,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:23:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2018-04-11 12:23:15,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 12:23:15,268 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:23:15,268 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:23:15,269 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:23:15,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1438606309, now seen corresponding path program 1 times [2018-04-11 12:23:15,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:23:15,269 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:23:15,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:15,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:15,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:15,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:23:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:15,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:23:15,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:23:15,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:23:15,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:23:15,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:23:15,332 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand 5 states. [2018-04-11 12:23:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:23:15,521 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2018-04-11 12:23:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:23:15,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 12:23:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:23:15,523 INFO L225 Difference]: With dead ends: 267 [2018-04-11 12:23:15,523 INFO L226 Difference]: Without dead ends: 267 [2018-04-11 12:23:15,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:23:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-11 12:23:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 236. [2018-04-11 12:23:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-11 12:23:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 275 transitions. [2018-04-11 12:23:15,531 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 275 transitions. Word has length 16 [2018-04-11 12:23:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:23:15,531 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 275 transitions. [2018-04-11 12:23:15,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:23:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2018-04-11 12:23:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 12:23:15,531 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:23:15,531 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:23:15,532 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:23:15,532 INFO L82 PathProgramCache]: Analyzing trace with hash -478807353, now seen corresponding path program 1 times [2018-04-11 12:23:15,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:23:15,532 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:23:15,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:15,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:15,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:15,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:23:15,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:15,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:23:15,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:23:15,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:23:15,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:23:15,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:23:15,570 INFO L87 Difference]: Start difference. First operand 236 states and 275 transitions. Second operand 5 states. [2018-04-11 12:23:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:23:15,753 INFO L93 Difference]: Finished difference Result 416 states and 486 transitions. [2018-04-11 12:23:15,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:23:15,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 12:23:15,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:23:15,756 INFO L225 Difference]: With dead ends: 416 [2018-04-11 12:23:15,756 INFO L226 Difference]: Without dead ends: 416 [2018-04-11 12:23:15,756 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-11 12:23:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-04-11 12:23:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 235. [2018-04-11 12:23:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-11 12:23:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 273 transitions. [2018-04-11 12:23:15,763 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 273 transitions. Word has length 18 [2018-04-11 12:23:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:23:15,763 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 273 transitions. [2018-04-11 12:23:15,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:23:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 273 transitions. [2018-04-11 12:23:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 12:23:15,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:23:15,764 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:23:15,764 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:23:15,764 INFO L82 PathProgramCache]: Analyzing trace with hash -478807352, now seen corresponding path program 1 times [2018-04-11 12:23:15,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:23:15,764 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:23:15,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:15,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:15,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:15,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:23:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:15,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:23:15,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:23:15,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:23:15,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:23:15,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:23:15,807 INFO L87 Difference]: Start difference. First operand 235 states and 273 transitions. Second operand 5 states. [2018-04-11 12:23:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:23:16,008 INFO L93 Difference]: Finished difference Result 425 states and 495 transitions. [2018-04-11 12:23:16,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:23:16,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 12:23:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:23:16,010 INFO L225 Difference]: With dead ends: 425 [2018-04-11 12:23:16,010 INFO L226 Difference]: Without dead ends: 425 [2018-04-11 12:23:16,010 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-11 12:23:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-04-11 12:23:16,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 234. [2018-04-11 12:23:16,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-11 12:23:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 271 transitions. [2018-04-11 12:23:16,016 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 271 transitions. Word has length 18 [2018-04-11 12:23:16,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:23:16,016 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 271 transitions. [2018-04-11 12:23:16,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:23:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 271 transitions. [2018-04-11 12:23:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 12:23:16,017 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:23:16,017 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-11 12:23:16,017 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:23:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash -287335223, now seen corresponding path program 1 times [2018-04-11 12:23:16,018 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:23:16,018 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:23:16,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:16,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:16,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:16,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:23:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:16,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:23:16,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 12:23:16,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 12:23:16,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 12:23:16,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 12:23:16,104 INFO L87 Difference]: Start difference. First operand 234 states and 271 transitions. Second operand 9 states. [2018-04-11 12:23:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:23:16,475 INFO L93 Difference]: Finished difference Result 240 states and 274 transitions. [2018-04-11 12:23:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:23:16,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-11 12:23:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:23:16,476 INFO L225 Difference]: With dead ends: 240 [2018-04-11 12:23:16,477 INFO L226 Difference]: Without dead ends: 240 [2018-04-11 12:23:16,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-04-11 12:23:16,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-11 12:23:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 233. [2018-04-11 12:23:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-04-11 12:23:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2018-04-11 12:23:16,481 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 22 [2018-04-11 12:23:16,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:23:16,481 INFO L459 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2018-04-11 12:23:16,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 12:23:16,481 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2018-04-11 12:23:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 12:23:16,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:23:16,482 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-11 12:23:16,482 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:23:16,482 INFO L82 PathProgramCache]: Analyzing trace with hash -287335222, now seen corresponding path program 1 times [2018-04-11 12:23:16,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:23:16,482 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:23:16,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:16,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:16,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:16,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:23:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:16,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:23:16,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 12:23:16,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 12:23:16,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 12:23:16,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:23:16,604 INFO L87 Difference]: Start difference. First operand 233 states and 270 transitions. Second operand 10 states. [2018-04-11 12:23:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:23:17,185 INFO L93 Difference]: Finished difference Result 236 states and 270 transitions. [2018-04-11 12:23:17,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 12:23:17,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-11 12:23:17,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:23:17,188 INFO L225 Difference]: With dead ends: 236 [2018-04-11 12:23:17,188 INFO L226 Difference]: Without dead ends: 236 [2018-04-11 12:23:17,189 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-11 12:23:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-11 12:23:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 218. [2018-04-11 12:23:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-11 12:23:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2018-04-11 12:23:17,192 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 22 [2018-04-11 12:23:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:23:17,193 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2018-04-11 12:23:17,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 12:23:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2018-04-11 12:23:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 12:23:17,193 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:23:17,194 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] [2018-04-11 12:23:17,194 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:23:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1793562549, now seen corresponding path program 1 times [2018-04-11 12:23:17,194 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:23:17,194 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:23:17,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:17,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:17,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:17,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:23:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:17,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:23:17,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:23:17,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 12:23:17,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 12:23:17,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 12:23:17,212 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand 3 states. [2018-04-11 12:23:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:23:17,220 INFO L93 Difference]: Finished difference Result 259 states and 298 transitions. [2018-04-11 12:23:17,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 12:23:17,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-04-11 12:23:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:23:17,221 INFO L225 Difference]: With dead ends: 259 [2018-04-11 12:23:17,221 INFO L226 Difference]: Without dead ends: 259 [2018-04-11 12:23:17,221 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 12:23:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-11 12:23:17,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 232. [2018-04-11 12:23:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-04-11 12:23:17,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 269 transitions. [2018-04-11 12:23:17,224 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 269 transitions. Word has length 25 [2018-04-11 12:23:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:23:17,224 INFO L459 AbstractCegarLoop]: Abstraction has 232 states and 269 transitions. [2018-04-11 12:23:17,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 12:23:17,224 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 269 transitions. [2018-04-11 12:23:17,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 12:23:17,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:23:17,225 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:23:17,225 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:23:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2135914195, now seen corresponding path program 1 times [2018-04-11 12:23:17,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:23:17,225 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:23:17,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:17,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:17,227 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:23:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:17,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:23:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:17,559 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:23:17,559 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:23:17,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:23:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:23:17,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:23:17,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:23:17,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:23:17,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:23:17,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:23:17,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:23:17,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 12:23:17,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:23:17,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:23:17,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:23:17,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:23:17,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:23:17,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 12:23:17,751 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-11 12:23:17,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:23:17,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:23:17,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:23:17,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:23:17,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-11 12:23:17,878 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-11 12:23:17,885 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-11 12:23:17,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:23:17,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:23:17,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 12:23:17,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:84 [2018-04-11 12:23:31,958 WARN L148 SmtUtils]: Spent 14018ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-11 12:23:46,047 WARN L148 SmtUtils]: Spent 14034ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-11 12:23:46,065 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 43 treesize of output 31 [2018-04-11 12:23:46,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 12:23:46,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:23:46,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 12:23:46,073 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:23:46,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:23:46,096 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 54 treesize of output 36 [2018-04-11 12:23:46,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 12:23:46,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:23:46,110 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 13 treesize of output 10 [2018-04-11 12:23:46,110 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:23:46,116 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:23:46,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 12:23:46,130 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:98, output treesize:46 [2018-04-11 12:23:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:23:46,195 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:23:46,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 32 [2018-04-11 12:23:46,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 12:23:46,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 12:23:46,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 12:23:46,196 INFO L87 Difference]: Start difference. First operand 232 states and 269 transitions. Second operand 33 states. [2018-04-11 12:24:15,086 WARN L151 SmtUtils]: Spent 28221ms on a formula simplification. DAG size of input: 78 DAG size of output 63 [2018-04-11 12:24:15,482 WARN L151 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 85 DAG size of output 43 [2018-04-11 12:24:16,122 WARN L151 SmtUtils]: Spent 388ms on a formula simplification. DAG size of input: 95 DAG size of output 45 [2018-04-11 12:24:16,533 WARN L151 SmtUtils]: Spent 362ms on a formula simplification. DAG size of input: 102 DAG size of output 47 [2018-04-11 12:24:16,985 WARN L151 SmtUtils]: Spent 389ms on a formula simplification. DAG size of input: 109 DAG size of output 50 [2018-04-11 12:24:17,455 WARN L151 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 61 DAG size of output 52 [2018-04-11 12:24:17,984 WARN L151 SmtUtils]: Spent 438ms on a formula simplification. DAG size of input: 68 DAG size of output 59 [2018-04-11 12:24:18,527 WARN L151 SmtUtils]: Spent 478ms on a formula simplification. DAG size of input: 73 DAG size of output 56 [2018-04-11 12:24:18,993 WARN L151 SmtUtils]: Spent 426ms on a formula simplification. DAG size of input: 68 DAG size of output 55 [2018-04-11 12:24:19,438 WARN L151 SmtUtils]: Spent 360ms on a formula simplification. DAG size of input: 48 DAG size of output 39 [2018-04-11 12:24:19,998 WARN L151 SmtUtils]: Spent 441ms on a formula simplification. DAG size of input: 56 DAG size of output 47 [2018-04-11 12:24:20,456 WARN L151 SmtUtils]: Spent 358ms on a formula simplification. DAG size of input: 61 DAG size of output 44 [2018-04-11 12:24:20,926 WARN L151 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 58 DAG size of output 42 [2018-04-11 12:24:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:21,683 INFO L93 Difference]: Finished difference Result 471 states and 520 transitions. [2018-04-11 12:24:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 12:24:21,683 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2018-04-11 12:24:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:21,684 INFO L225 Difference]: With dead ends: 471 [2018-04-11 12:24:21,684 INFO L226 Difference]: Without dead ends: 471 [2018-04-11 12:24:21,686 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 62.8s TimeCoverageRelationStatistics Valid=1012, Invalid=4688, Unknown=0, NotChecked=0, Total=5700 [2018-04-11 12:24:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-04-11 12:24:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 261. [2018-04-11 12:24:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-11 12:24:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 301 transitions. [2018-04-11 12:24:21,691 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 301 transitions. Word has length 40 [2018-04-11 12:24:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:21,691 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 301 transitions. [2018-04-11 12:24:21,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 12:24:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2018-04-11 12:24:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 12:24:21,692 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:21,692 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:24:21,693 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash -2135914194, now seen corresponding path program 1 times [2018-04-11 12:24:21,693 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:21,693 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:21,694 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:21,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:21,694 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:21,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:22,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:24:22,091 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:24:22,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:22,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:24:22,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:22,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:22,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:24:22,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 12:24:22,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 12:24:22,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:24:22,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:24:22,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:24:22,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:24:22,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2018-04-11 12:24:22,266 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-11 12:24:22,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:24:22,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,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, 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-11 12:24:22,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:24:22,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:22,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-11 12:24:22,397 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-11 12:24:22,406 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-11 12:24:22,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:22,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:22,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 12:24:22,462 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-11 12:24:22,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:22,471 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-11 12:24:22,477 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-11 12:24:22,478 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:22,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:22,509 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-11 12:24:22,509 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:89, output treesize:125 [2018-04-11 12:24:22,738 WARN L148 SmtUtils]: Spent 198ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-11 12:24:23,032 WARN L148 SmtUtils]: Spent 248ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-11 12:24:23,055 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 65 treesize of output 55 [2018-04-11 12:24:23,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 12:24:23,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,068 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 1 [2018-04-11 12:24:23,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,107 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 87 treesize of output 65 [2018-04-11 12:24:23,109 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 39 treesize of output 26 [2018-04-11 12:24:23,109 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,122 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 13 treesize of output 10 [2018-04-11 12:24:23,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:23,131 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:23,157 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 46 treesize of output 38 [2018-04-11 12:24:23,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 12:24:23,158 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,165 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 12:24:23,165 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,169 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,170 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 43 treesize of output 35 [2018-04-11 12:24:23,174 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 13 treesize of output 10 [2018-04-11 12:24:23,175 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:23,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 12:24:23,182 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,187 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:23,205 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 41 treesize of output 29 [2018-04-11 12:24:23,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 12:24:23,207 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,211 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 1 [2018-04-11 12:24:23,211 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,213 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:23,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:23,225 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:153, output treesize:23 [2018-04-11 12:24:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:23,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:24:23,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 30 [2018-04-11 12:24:23,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 12:24:23,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 12:24:23,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2018-04-11 12:24:23,272 INFO L87 Difference]: Start difference. First operand 261 states and 301 transitions. Second operand 31 states. [2018-04-11 12:24:24,348 WARN L151 SmtUtils]: Spent 409ms on a formula simplification. DAG size of input: 77 DAG size of output 75 [2018-04-11 12:24:24,870 WARN L151 SmtUtils]: Spent 370ms on a formula simplification. DAG size of input: 95 DAG size of output 57 [2018-04-11 12:24:25,598 WARN L151 SmtUtils]: Spent 637ms on a formula simplification. DAG size of input: 103 DAG size of output 63 [2018-04-11 12:24:26,223 WARN L151 SmtUtils]: Spent 569ms on a formula simplification. DAG size of input: 108 DAG size of output 68 [2018-04-11 12:24:26,774 WARN L151 SmtUtils]: Spent 474ms on a formula simplification. DAG size of input: 62 DAG size of output 61 [2018-04-11 12:24:27,410 WARN L151 SmtUtils]: Spent 553ms on a formula simplification. DAG size of input: 73 DAG size of output 72 [2018-04-11 12:24:27,997 WARN L151 SmtUtils]: Spent 534ms on a formula simplification. DAG size of input: 69 DAG size of output 68 [2018-04-11 12:24:28,378 WARN L148 SmtUtils]: Spent 206ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-11 12:24:28,742 WARN L148 SmtUtils]: Spent 208ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-11 12:24:29,026 WARN L148 SmtUtils]: Spent 197ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-11 12:24:29,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:29,718 INFO L93 Difference]: Finished difference Result 464 states and 513 transitions. [2018-04-11 12:24:29,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 12:24:29,718 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-04-11 12:24:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:29,719 INFO L225 Difference]: With dead ends: 464 [2018-04-11 12:24:29,719 INFO L226 Difference]: Without dead ends: 464 [2018-04-11 12:24:29,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=857, Invalid=3699, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 12:24:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-11 12:24:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 261. [2018-04-11 12:24:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-11 12:24:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 300 transitions. [2018-04-11 12:24:29,723 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 300 transitions. Word has length 40 [2018-04-11 12:24:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:29,723 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 300 transitions. [2018-04-11 12:24:29,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 12:24:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions. [2018-04-11 12:24:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 12:24:29,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:29,724 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] [2018-04-11 12:24:29,724 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:29,725 INFO L82 PathProgramCache]: Analyzing trace with hash -808260317, now seen corresponding path program 1 times [2018-04-11 12:24:29,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:29,725 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:29,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:29,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:29,726 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:29,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:24:29,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:24:29,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:24:29,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 12:24:29,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 12:24:29,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 12:24:29,746 INFO L87 Difference]: Start difference. First operand 261 states and 300 transitions. Second operand 3 states. [2018-04-11 12:24:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:29,750 INFO L93 Difference]: Finished difference Result 263 states and 302 transitions. [2018-04-11 12:24:29,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 12:24:29,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-04-11 12:24:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:29,751 INFO L225 Difference]: With dead ends: 263 [2018-04-11 12:24:29,751 INFO L226 Difference]: Without dead ends: 263 [2018-04-11 12:24:29,751 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 12:24:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-11 12:24:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-04-11 12:24:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-04-11 12:24:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 302 transitions. [2018-04-11 12:24:29,754 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 302 transitions. Word has length 43 [2018-04-11 12:24:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:29,754 INFO L459 AbstractCegarLoop]: Abstraction has 263 states and 302 transitions. [2018-04-11 12:24:29,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 12:24:29,754 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 302 transitions. [2018-04-11 12:24:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 12:24:29,754 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:29,754 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] [2018-04-11 12:24:29,754 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1074525530, now seen corresponding path program 1 times [2018-04-11 12:24:29,755 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:29,755 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:29,755 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:29,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:29,755 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:29,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:24:29,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:24:29,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:24:29,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:24:29,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:24:29,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:24:29,785 INFO L87 Difference]: Start difference. First operand 263 states and 302 transitions. Second operand 6 states. [2018-04-11 12:24:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:29,995 INFO L93 Difference]: Finished difference Result 297 states and 343 transitions. [2018-04-11 12:24:29,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 12:24:29,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-04-11 12:24:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:29,996 INFO L225 Difference]: With dead ends: 297 [2018-04-11 12:24:29,997 INFO L226 Difference]: Without dead ends: 297 [2018-04-11 12:24:29,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:24:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-11 12:24:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 262. [2018-04-11 12:24:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-04-11 12:24:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 301 transitions. [2018-04-11 12:24:30,000 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 301 transitions. Word has length 46 [2018-04-11 12:24:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:30,000 INFO L459 AbstractCegarLoop]: Abstraction has 262 states and 301 transitions. [2018-04-11 12:24:30,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:24:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 301 transitions. [2018-04-11 12:24:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 12:24:30,001 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:30,001 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] [2018-04-11 12:24:30,001 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:30,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1074525531, now seen corresponding path program 1 times [2018-04-11 12:24:30,001 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:30,001 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:30,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:30,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:30,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:30,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:30,365 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:24:30,365 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:24:30,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:30,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:24:30,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:30,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:30,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:24:30,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 12:24:30,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:24:30,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:24:30,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:24:30,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:24:30,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-11 12:24:30,491 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-11 12:24:30,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:24:30,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,506 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-11 12:24:30,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:24:30,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:30,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-04-11 12:24:30,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-04-11 12:24:30,540 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 23 treesize of output 14 [2018-04-11 12:24:30,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,543 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 1 [2018-04-11 12:24:30,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:30,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:30,548 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:21 [2018-04-11 12:24:30,582 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 28 treesize of output 27 [2018-04-11 12:24:30,588 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-11 12:24:30,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:30,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:30,604 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-11 12:24:30,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:50 [2018-04-11 12:24:30,964 WARN L148 SmtUtils]: Spent 186ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-11 12:24:31,303 WARN L148 SmtUtils]: Spent 203ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-11 12:24:31,576 WARN L148 SmtUtils]: Spent 242ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-11 12:24:31,783 WARN L148 SmtUtils]: Spent 174ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-11 12:24:31,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 78 treesize of output 74 [2018-04-11 12:24:31,794 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 37 treesize of output 17 [2018-04-11 12:24:31,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,815 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 55 treesize of output 41 [2018-04-11 12:24:31,820 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 32 treesize of output 11 [2018-04-11 12:24:31,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 12:24:31,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,868 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 50 treesize of output 46 [2018-04-11 12:24:31,875 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 24 treesize of output 15 [2018-04-11 12:24:31,875 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,882 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 1 [2018-04-11 12:24:31,882 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,886 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 22 [2018-04-11 12:24:31,897 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 7 [2018-04-11 12:24:31,897 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,900 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:31,909 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:129, output treesize:11 [2018-04-11 12:24:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:31,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:24:31,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 36 [2018-04-11 12:24:31,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 12:24:31,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 12:24:31,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 12:24:31,979 INFO L87 Difference]: Start difference. First operand 262 states and 301 transitions. Second operand 37 states. [2018-04-11 12:24:32,904 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 109 DAG size of output 55 [2018-04-11 12:24:33,958 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 97 DAG size of output 51 [2018-04-11 12:24:34,216 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 105 DAG size of output 56 [2018-04-11 12:24:34,771 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 65 DAG size of output 41 [2018-04-11 12:24:35,133 WARN L151 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 54 DAG size of output 36 [2018-04-11 12:24:35,510 WARN L151 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 60 DAG size of output 40 [2018-04-11 12:24:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:37,491 INFO L93 Difference]: Finished difference Result 451 states and 495 transitions. [2018-04-11 12:24:37,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 12:24:37,491 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-04-11 12:24:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:37,492 INFO L225 Difference]: With dead ends: 451 [2018-04-11 12:24:37,492 INFO L226 Difference]: Without dead ends: 451 [2018-04-11 12:24:37,492 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=884, Invalid=3946, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 12:24:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-04-11 12:24:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 266. [2018-04-11 12:24:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-04-11 12:24:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 306 transitions. [2018-04-11 12:24:37,495 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 306 transitions. Word has length 46 [2018-04-11 12:24:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:37,496 INFO L459 AbstractCegarLoop]: Abstraction has 266 states and 306 transitions. [2018-04-11 12:24:37,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 12:24:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 306 transitions. [2018-04-11 12:24:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 12:24:37,496 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:37,496 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:24:37,496 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:37,496 INFO L82 PathProgramCache]: Analyzing trace with hash 222607969, now seen corresponding path program 1 times [2018-04-11 12:24:37,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:37,497 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:37,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:37,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:37,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:37,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:24:37,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:24:37,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:24:37,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 12:24:37,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 12:24:37,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:24:37,543 INFO L87 Difference]: Start difference. First operand 266 states and 306 transitions. Second operand 7 states. [2018-04-11 12:24:37,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:37,676 INFO L93 Difference]: Finished difference Result 295 states and 341 transitions. [2018-04-11 12:24:37,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:24:37,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-04-11 12:24:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:37,677 INFO L225 Difference]: With dead ends: 295 [2018-04-11 12:24:37,677 INFO L226 Difference]: Without dead ends: 295 [2018-04-11 12:24:37,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:24:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-11 12:24:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 276. [2018-04-11 12:24:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-04-11 12:24:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 317 transitions. [2018-04-11 12:24:37,681 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 317 transitions. Word has length 47 [2018-04-11 12:24:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:37,681 INFO L459 AbstractCegarLoop]: Abstraction has 276 states and 317 transitions. [2018-04-11 12:24:37,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 12:24:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 317 transitions. [2018-04-11 12:24:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 12:24:37,681 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:37,682 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:24:37,682 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:37,682 INFO L82 PathProgramCache]: Analyzing trace with hash 224455011, now seen corresponding path program 1 times [2018-04-11 12:24:37,682 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:37,682 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:37,683 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:37,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:37,683 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:37,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:24:37,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:24:37,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:24:37,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:24:37,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:24:37,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:24:37,718 INFO L87 Difference]: Start difference. First operand 276 states and 317 transitions. Second operand 4 states. [2018-04-11 12:24:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:37,762 INFO L93 Difference]: Finished difference Result 273 states and 310 transitions. [2018-04-11 12:24:37,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:24:37,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-04-11 12:24:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:37,764 INFO L225 Difference]: With dead ends: 273 [2018-04-11 12:24:37,764 INFO L226 Difference]: Without dead ends: 273 [2018-04-11 12:24:37,764 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:24:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-11 12:24:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2018-04-11 12:24:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-11 12:24:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 309 transitions. [2018-04-11 12:24:37,767 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 309 transitions. Word has length 47 [2018-04-11 12:24:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:37,767 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 309 transitions. [2018-04-11 12:24:37,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:24:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 309 transitions. [2018-04-11 12:24:37,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 12:24:37,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:37,767 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:24:37,767 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:37,767 INFO L82 PathProgramCache]: Analyzing trace with hash 224455012, now seen corresponding path program 1 times [2018-04-11 12:24:37,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:37,767 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:37,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:37,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:37,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:37,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:24:37,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:24:37,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:24:37,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:24:37,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:24:37,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:24:37,805 INFO L87 Difference]: Start difference. First operand 272 states and 309 transitions. Second operand 4 states. [2018-04-11 12:24:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:37,850 INFO L93 Difference]: Finished difference Result 268 states and 301 transitions. [2018-04-11 12:24:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:24:37,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-04-11 12:24:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:37,851 INFO L225 Difference]: With dead ends: 268 [2018-04-11 12:24:37,851 INFO L226 Difference]: Without dead ends: 268 [2018-04-11 12:24:37,852 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:24:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-04-11 12:24:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-04-11 12:24:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-04-11 12:24:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 301 transitions. [2018-04-11 12:24:37,854 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 301 transitions. Word has length 47 [2018-04-11 12:24:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:37,854 INFO L459 AbstractCegarLoop]: Abstraction has 268 states and 301 transitions. [2018-04-11 12:24:37,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:24:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 301 transitions. [2018-04-11 12:24:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 12:24:37,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:37,855 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-04-11 12:24:37,855 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1004839968, now seen corresponding path program 1 times [2018-04-11 12:24:37,855 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:37,855 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:37,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:37,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:37,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:37,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:38,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:24:38,348 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:24:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:38,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:24:38,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 12:24:38,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:38,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:38,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 12:24:38,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:38,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:38,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:24:38,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:38,487 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 12 treesize of output 15 [2018-04-11 12:24:38,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:38,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:38,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-04-11 12:24:38,661 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 3 case distinctions, treesize of input 47 treesize of output 61 [2018-04-11 12:24:38,663 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 48 treesize of output 47 [2018-04-11 12:24:38,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:38,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:38,698 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2018-04-11 12:24:38,704 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2018-04-11 12:24:38,704 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:38,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-04-11 12:24:38,717 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:38,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:38,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 12:24:38,732 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:64, output treesize:85 [2018-04-11 12:24:39,019 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-11 12:24:39,602 WARN L151 SmtUtils]: Spent 420ms on a formula simplification. DAG size of input: 50 DAG size of output 45 [2018-04-11 12:24:39,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 88 [2018-04-11 12:24:39,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:39,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 88 [2018-04-11 12:24:39,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:39,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 12:24:39,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:161, output treesize:235 [2018-04-11 12:24:40,296 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 12:24:40,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:40,324 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2018-04-11 12:24:40,325 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-11 12:24:40,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:40,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-04-11 12:24:40,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:40,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:40,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:40,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2018-04-11 12:24:40,379 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 13 treesize of output 9 [2018-04-11 12:24:40,379 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:40,390 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 24 treesize of output 15 [2018-04-11 12:24:40,390 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:40,398 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:40,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 12:24:40,417 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:260, output treesize:106 [2018-04-11 12:24:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:40,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:24:40,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 40 [2018-04-11 12:24:40,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 12:24:40,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 12:24:40,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1409, Unknown=15, NotChecked=0, Total=1560 [2018-04-11 12:24:40,668 INFO L87 Difference]: Start difference. First operand 268 states and 301 transitions. Second operand 40 states. [2018-04-11 12:24:41,261 WARN L151 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 104 DAG size of output 58 [2018-04-11 12:24:41,806 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 74 DAG size of output 48 [2018-04-11 12:24:42,008 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 101 DAG size of output 56 [2018-04-11 12:24:42,249 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 103 DAG size of output 58 [2018-04-11 12:24:42,487 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 112 DAG size of output 56 [2018-04-11 12:24:42,862 WARN L151 SmtUtils]: Spent 325ms on a formula simplification. DAG size of input: 122 DAG size of output 70 [2018-04-11 12:24:43,050 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 132 DAG size of output 53 [2018-04-11 12:24:43,242 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 113 DAG size of output 50 [2018-04-11 12:24:43,486 WARN L151 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 136 DAG size of output 57 [2018-04-11 12:24:43,627 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 97 DAG size of output 40 [2018-04-11 12:24:43,915 WARN L151 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 143 DAG size of output 59 [2018-04-11 12:24:44,088 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 137 DAG size of output 58 [2018-04-11 12:24:44,226 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 114 DAG size of output 49 [2018-04-11 12:24:44,471 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 175 DAG size of output 110 [2018-04-11 12:24:44,691 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 122 DAG size of output 115 [2018-04-11 12:24:44,981 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 143 DAG size of output 103 [2018-04-11 12:24:45,268 WARN L151 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 148 DAG size of output 106 [2018-04-11 12:24:45,549 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 58 DAG size of output 51 [2018-04-11 12:24:46,710 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 66 DAG size of output 59 [2018-04-11 12:24:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:47,974 INFO L93 Difference]: Finished difference Result 428 states and 468 transitions. [2018-04-11 12:24:47,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 12:24:47,975 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2018-04-11 12:24:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:47,976 INFO L225 Difference]: With dead ends: 428 [2018-04-11 12:24:47,976 INFO L226 Difference]: Without dead ends: 428 [2018-04-11 12:24:47,977 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1187, Invalid=5270, Unknown=23, NotChecked=0, Total=6480 [2018-04-11 12:24:47,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-04-11 12:24:47,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 272. [2018-04-11 12:24:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-04-11 12:24:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 305 transitions. [2018-04-11 12:24:47,979 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 305 transitions. Word has length 50 [2018-04-11 12:24:47,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:47,979 INFO L459 AbstractCegarLoop]: Abstraction has 272 states and 305 transitions. [2018-04-11 12:24:47,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 12:24:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 305 transitions. [2018-04-11 12:24:47,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 12:24:47,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:47,980 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:24:47,980 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:47,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1801987223, now seen corresponding path program 1 times [2018-04-11 12:24:47,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:47,980 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:47,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:47,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:47,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:47,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:24:48,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:24:48,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:24:48,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:24:48,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:24:48,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:24:48,029 INFO L87 Difference]: Start difference. First operand 272 states and 305 transitions. Second operand 6 states. [2018-04-11 12:24:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:48,172 INFO L93 Difference]: Finished difference Result 302 states and 336 transitions. [2018-04-11 12:24:48,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 12:24:48,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-04-11 12:24:48,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:48,173 INFO L225 Difference]: With dead ends: 302 [2018-04-11 12:24:48,173 INFO L226 Difference]: Without dead ends: 302 [2018-04-11 12:24:48,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:24:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-11 12:24:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 281. [2018-04-11 12:24:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-11 12:24:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 319 transitions. [2018-04-11 12:24:48,176 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 319 transitions. Word has length 51 [2018-04-11 12:24:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:48,176 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 319 transitions. [2018-04-11 12:24:48,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:24:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 319 transitions. [2018-04-11 12:24:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 12:24:48,177 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:48,177 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:24:48,177 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:48,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1801987224, now seen corresponding path program 1 times [2018-04-11 12:24:48,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:48,177 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:48,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:48,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:48,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:48,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:48,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:24:48,460 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:24:48,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:48,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:24:48,530 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 23 treesize of output 19 [2018-04-11 12:24:48,532 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 19 treesize of output 11 [2018-04-11 12:24:48,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:48,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:48,538 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 28 treesize of output 22 [2018-04-11 12:24:48,539 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 22 treesize of output 13 [2018-04-11 12:24:48,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:48,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:48,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:48,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-04-11 12:24:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:24:48,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 12:24:48,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 24 [2018-04-11 12:24:48,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 12:24:48,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 12:24:48,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-04-11 12:24:48,593 INFO L87 Difference]: Start difference. First operand 281 states and 319 transitions. Second operand 25 states. [2018-04-11 12:24:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:50,689 INFO L93 Difference]: Finished difference Result 420 states and 459 transitions. [2018-04-11 12:24:50,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 12:24:50,691 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 51 [2018-04-11 12:24:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:50,692 INFO L225 Difference]: With dead ends: 420 [2018-04-11 12:24:50,692 INFO L226 Difference]: Without dead ends: 420 [2018-04-11 12:24:50,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=865, Invalid=3557, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 12:24:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-04-11 12:24:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 292. [2018-04-11 12:24:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-04-11 12:24:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 328 transitions. [2018-04-11 12:24:50,697 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 328 transitions. Word has length 51 [2018-04-11 12:24:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:50,697 INFO L459 AbstractCegarLoop]: Abstraction has 292 states and 328 transitions. [2018-04-11 12:24:50,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 12:24:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 328 transitions. [2018-04-11 12:24:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 12:24:50,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:50,698 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:24:50,698 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:50,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2133118707, now seen corresponding path program 1 times [2018-04-11 12:24:50,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:50,698 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:50,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:50,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:50,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:50,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:50,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:24:50,827 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:24:50,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:50,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:24:50,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:50,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:50,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:24:50,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:50,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:50,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-04-11 12:24:50,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 12:24:50,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:24:50,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:50,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:50,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 12:24:50,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:24:50,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:50,934 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:50,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:50,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 12:24:50,967 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 28 treesize of output 27 [2018-04-11 12:24:50,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:50,977 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 16 treesize of output 23 [2018-04-11 12:24:50,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:50,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:50,993 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 28 treesize of output 33 [2018-04-11 12:24:50,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:50,996 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 16 treesize of output 23 [2018-04-11 12:24:50,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:51,002 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:51,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:51,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:57 [2018-04-11 12:24:51,036 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 77 [2018-04-11 12:24:51,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:51,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-11 12:24:51,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:51,046 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 23 treesize of output 3 [2018-04-11 12:24:51,046 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:51,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:51,058 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 34 treesize of output 28 [2018-04-11 12:24:51,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:51,061 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 24 treesize of output 17 [2018-04-11 12:24:51,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:51,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 12:24:51,072 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:51,073 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:51,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:51,076 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:101, output treesize:7 [2018-04-11 12:24:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:51,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:24:51,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 22 [2018-04-11 12:24:51,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 12:24:51,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 12:24:51,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-04-11 12:24:51,110 INFO L87 Difference]: Start difference. First operand 292 states and 328 transitions. Second operand 22 states. [2018-04-11 12:24:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:52,386 INFO L93 Difference]: Finished difference Result 350 states and 380 transitions. [2018-04-11 12:24:52,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 12:24:52,386 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-04-11 12:24:52,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:52,387 INFO L225 Difference]: With dead ends: 350 [2018-04-11 12:24:52,387 INFO L226 Difference]: Without dead ends: 350 [2018-04-11 12:24:52,387 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=434, Invalid=1543, Unknown=3, NotChecked=0, Total=1980 [2018-04-11 12:24:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-11 12:24:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 306. [2018-04-11 12:24:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-04-11 12:24:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 341 transitions. [2018-04-11 12:24:52,390 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 341 transitions. Word has length 53 [2018-04-11 12:24:52,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:52,390 INFO L459 AbstractCegarLoop]: Abstraction has 306 states and 341 transitions. [2018-04-11 12:24:52,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 12:24:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 341 transitions. [2018-04-11 12:24:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 12:24:52,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:52,390 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:24:52,390 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:52,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1401734189, now seen corresponding path program 1 times [2018-04-11 12:24:52,391 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:52,391 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:52,391 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:52,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:52,391 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:52,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:52,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:24:52,808 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:24:52,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:52,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:24:52,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:52,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:52,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:24:52,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:52,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:52,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 12:24:52,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:24:52,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:24:52,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:52,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:52,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:52,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 12:24:52,927 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-11 12:24:52,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:24:52,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:52,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:52,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:52,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 12:24:53,021 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-11 12:24:53,036 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-11 12:24:53,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:53,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:53,062 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-11 12:24:53,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:68 [2018-04-11 12:24:53,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:53,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:53,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:53,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 12:24:53,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-04-11 12:24:53,164 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 26 treesize of output 25 [2018-04-11 12:24:53,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 12:24:53,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:33 [2018-04-11 12:24:53,229 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 45 treesize of output 45 [2018-04-11 12:24:53,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:24:53,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:53,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-11 12:24:53,501 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-11 12:24:53,508 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-11 12:24:53,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:53,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:53,535 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-11 12:24:53,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:146 [2018-04-11 12:24:53,735 WARN L148 SmtUtils]: Spent 168ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-11 12:24:53,926 WARN L148 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-11 12:24:53,937 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 70 treesize of output 45 [2018-04-11 12:24:53,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-11 12:24:53,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,944 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-11 12:24:53,944 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,948 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 1 [2018-04-11 12:24:53,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,962 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 89 treesize of output 52 [2018-04-11 12:24:53,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-04-11 12:24:53,964 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,977 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 1 case distinctions, treesize of input 40 treesize of output 26 [2018-04-11 12:24:53,978 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:53,989 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 25 treesize of output 21 [2018-04-11 12:24:53,989 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,990 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 28 treesize of output 24 [2018-04-11 12:24:53,990 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:53,997 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:54,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:54,005 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:160, output treesize:15 [2018-04-11 12:24:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:54,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:24:54,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-04-11 12:24:54,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 12:24:54,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 12:24:54,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1185, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 12:24:54,046 INFO L87 Difference]: Start difference. First operand 306 states and 341 transitions. Second operand 37 states. [2018-04-11 12:24:55,549 WARN L151 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 62 DAG size of output 62 [2018-04-11 12:24:56,023 WARN L151 SmtUtils]: Spent 315ms on a formula simplification. DAG size of input: 111 DAG size of output 62 [2018-04-11 12:24:56,516 WARN L151 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 114 DAG size of output 65 [2018-04-11 12:24:56,869 WARN L148 SmtUtils]: Spent 192ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-11 12:24:57,191 WARN L148 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 62 [2018-04-11 12:24:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:24:57,705 INFO L93 Difference]: Finished difference Result 519 states and 568 transitions. [2018-04-11 12:24:57,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 12:24:57,705 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-04-11 12:24:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:24:57,707 INFO L225 Difference]: With dead ends: 519 [2018-04-11 12:24:57,707 INFO L226 Difference]: Without dead ends: 519 [2018-04-11 12:24:57,708 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=755, Invalid=3801, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 12:24:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-04-11 12:24:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 347. [2018-04-11 12:24:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-11 12:24:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 387 transitions. [2018-04-11 12:24:57,711 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 387 transitions. Word has length 55 [2018-04-11 12:24:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:24:57,711 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 387 transitions. [2018-04-11 12:24:57,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 12:24:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 387 transitions. [2018-04-11 12:24:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 12:24:57,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:24:57,711 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:24:57,711 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:24:57,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1401734188, now seen corresponding path program 1 times [2018-04-11 12:24:57,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:24:57,711 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:24:57,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:57,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:57,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:24:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:57,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:24:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:58,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:24:58,184 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:24:58,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:24:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:24:58,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:24:58,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:58,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:58,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:24:58,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 12:24:58,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:24:58,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:24:58,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:24:58,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:24:58,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,258 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-11 12:24:58,305 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-11 12:24:58,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:24:58,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,322 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-11 12:24:58,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:24:58,323 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:58,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-11 12:24:58,411 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-11 12:24:58,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 12:24:58,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:58,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:58,455 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 60 [2018-04-11 12:24:58,461 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-11 12:24:58,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:58,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:58,477 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 55 treesize of output 50 [2018-04-11 12:24:58,479 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-11 12:24:58,479 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,484 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,506 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-11 12:24:58,506 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:84, output treesize:129 [2018-04-11 12:24:58,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:58,582 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 21 [2018-04-11 12:24:58,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:58,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:58,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:24:58,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 12:24:58,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-04-11 12:24:58,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-04-11 12:24:58,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-11 12:24:58,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,662 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 48 treesize of output 47 [2018-04-11 12:24:58,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 12:24:58,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,678 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:58 [2018-04-11 12:24:58,731 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 29 treesize of output 30 [2018-04-11 12:24:58,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:24:58,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,752 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 78 treesize of output 78 [2018-04-11 12:24:58,753 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-11 12:24:58,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:58,771 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:100, output treesize:84 [2018-04-11 12:24:58,878 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-11 12:24:58,885 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-11 12:24:58,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:58,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:58,921 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-11 12:24:58,923 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-11 12:24:58,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:58,937 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-11 12:24:58,944 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-11 12:24:58,944 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:58,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:58,990 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-11 12:24:58,990 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:163, output treesize:245 [2018-04-11 12:24:59,152 WARN L148 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-11 12:24:59,351 WARN L148 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-11 12:24:59,385 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 153 treesize of output 98 [2018-04-11 12:24:59,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 12:24:59,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:59,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2018-04-11 12:24:59,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:59,426 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 33 treesize of output 22 [2018-04-11 12:24:59,427 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,429 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 32 treesize of output 19 [2018-04-11 12:24:59,429 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 12:24:59,494 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 64 treesize of output 56 [2018-04-11 12:24:59,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 12:24:59,496 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,507 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 12:24:59,507 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,514 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,515 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 61 treesize of output 57 [2018-04-11 12:24:59,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 12:24:59,517 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,531 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 13 treesize of output 10 [2018-04-11 12:24:59,532 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 12:24:59,541 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:24:59,592 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 119 treesize of output 82 [2018-04-11 12:24:59,593 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 1 [2018-04-11 12:24:59,593 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-11 12:24:59,606 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:59,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-11 12:24:59,617 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,625 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:24:59,680 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 51 treesize of output 45 [2018-04-11 12:24:59,681 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 1 [2018-04-11 12:24:59,681 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 12:24:59,689 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,695 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:24:59,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 12:24:59,732 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 13 variables, input treesize:273, output treesize:58 [2018-04-11 12:24:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:24:59,926 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:24:59,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-04-11 12:24:59,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 12:24:59,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 12:24:59,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1201, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 12:24:59,927 INFO L87 Difference]: Start difference. First operand 347 states and 387 transitions. Second operand 37 states. [2018-04-11 12:25:01,522 WARN L151 SmtUtils]: Spent 280ms on a formula simplification. DAG size of input: 76 DAG size of output 76 [2018-04-11 12:25:02,273 WARN L151 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 127 DAG size of output 79 [2018-04-11 12:25:02,721 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 140 DAG size of output 84 [2018-04-11 12:25:03,174 WARN L151 SmtUtils]: Spent 268ms on a formula simplification. DAG size of input: 73 DAG size of output 73 [2018-04-11 12:25:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:25:03,977 INFO L93 Difference]: Finished difference Result 518 states and 567 transitions. [2018-04-11 12:25:03,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 12:25:03,977 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 55 [2018-04-11 12:25:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:25:03,978 INFO L225 Difference]: With dead ends: 518 [2018-04-11 12:25:03,978 INFO L226 Difference]: Without dead ends: 518 [2018-04-11 12:25:03,978 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=491, Invalid=3291, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 12:25:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-04-11 12:25:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 347. [2018-04-11 12:25:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-11 12:25:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 386 transitions. [2018-04-11 12:25:03,981 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 386 transitions. Word has length 55 [2018-04-11 12:25:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:25:03,982 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 386 transitions. [2018-04-11 12:25:03,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 12:25:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 386 transitions. [2018-04-11 12:25:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 12:25:03,983 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:25:03,983 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:25:03,983 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:25:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1257449240, now seen corresponding path program 1 times [2018-04-11 12:25:03,983 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:25:03,983 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:25:03,984 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:03,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:03,984 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:03,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:25:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:04,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:25:04,120 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:25:04,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:04,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:25:04,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:04,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:04,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:04,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-04-11 12:25:04,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:04,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:04,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:32 [2018-04-11 12:25:04,221 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-11 12:25:04,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:25:04,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:04,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:04,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:04,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2018-04-11 12:25:04,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-11 12:25:04,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:04,257 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 16 treesize of output 23 [2018-04-11 12:25:04,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:04,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:04,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:04,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-11 12:25:04,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-04-11 12:25:04,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 12:25:04,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:04,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:04,325 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-11 12:25:04,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:04,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:04,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:04,335 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:76, output treesize:24 [2018-04-11 12:25:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:04,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:25:04,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2018-04-11 12:25:04,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 12:25:04,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 12:25:04,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-04-11 12:25:04,396 INFO L87 Difference]: Start difference. First operand 347 states and 386 transitions. Second operand 23 states. [2018-04-11 12:25:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:25:05,430 INFO L93 Difference]: Finished difference Result 410 states and 446 transitions. [2018-04-11 12:25:05,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 12:25:05,430 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-04-11 12:25:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:25:05,431 INFO L225 Difference]: With dead ends: 410 [2018-04-11 12:25:05,431 INFO L226 Difference]: Without dead ends: 410 [2018-04-11 12:25:05,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=515, Invalid=1741, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 12:25:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-11 12:25:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 357. [2018-04-11 12:25:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-04-11 12:25:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 399 transitions. [2018-04-11 12:25:05,434 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 399 transitions. Word has length 56 [2018-04-11 12:25:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:25:05,434 INFO L459 AbstractCegarLoop]: Abstraction has 357 states and 399 transitions. [2018-04-11 12:25:05,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 12:25:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 399 transitions. [2018-04-11 12:25:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 12:25:05,435 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:25:05,435 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:25:05,435 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:25:05,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1257449239, now seen corresponding path program 1 times [2018-04-11 12:25:05,435 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:25:05,435 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:25:05,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:05,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:05,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:05,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:25:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:05,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:25:05,912 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:25:05,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:05,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:25:05,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 12:25:05,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:05,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:05,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:05,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:25:05,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:05,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:05,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 12:25:06,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-11 12:25:06,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-11 12:25:06,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:25:06,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:25:06,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-11 12:25:06,074 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-11 12:25:06,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-11 12:25:06,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,092 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-11 12:25:06,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:06,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:06,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2018-04-11 12:25:06,186 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-11 12:25:06,192 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-11 12:25:06,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:06,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:06,229 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-11 12:25:06,231 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-11 12:25:06,232 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:06,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 68 [2018-04-11 12:25:06,247 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-11 12:25:06,247 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:06,259 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:06,288 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-11 12:25:06,288 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:94, output treesize:135 [2018-04-11 12:25:06,647 WARN L148 SmtUtils]: Spent 330ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-11 12:25:07,023 WARN L148 SmtUtils]: Spent 339ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-11 12:25:07,038 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 67 treesize of output 66 [2018-04-11 12:25:07,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:07,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:07,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:07,061 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 89 treesize of output 83 [2018-04-11 12:25:07,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:07,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:07,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:07,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-04-11 12:25:07,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:07,104 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 83 treesize of output 82 [2018-04-11 12:25:07,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:07,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 12:25:07,125 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:157, output treesize:143 [2018-04-11 12:25:07,405 WARN L148 SmtUtils]: Spent 251ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-11 12:25:07,655 WARN L148 SmtUtils]: Spent 218ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-11 12:25:07,672 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 118 [2018-04-11 12:25:07,675 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 109 treesize of output 108 [2018-04-11 12:25:07,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:07,737 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 3 case distinctions, treesize of input 83 treesize of output 102 [2018-04-11 12:25:07,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-04-11 12:25:07,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:07,857 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 102 [2018-04-11 12:25:07,860 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 80 treesize of output 81 [2018-04-11 12:25:07,860 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:07,892 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 79 treesize of output 78 [2018-04-11 12:25:07,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:07,912 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:07,979 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 109 [2018-04-11 12:25:07,981 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 105 treesize of output 104 [2018-04-11 12:25:07,982 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:08,029 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 3 case distinctions, treesize of input 83 treesize of output 102 [2018-04-11 12:25:08,029 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-11 12:25:08,068 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:08,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 81 [2018-04-11 12:25:08,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2018-04-11 12:25:08,076 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:08,088 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:08,151 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 93 [2018-04-11 12:25:08,153 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 83 treesize of output 82 [2018-04-11 12:25:08,153 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:08,199 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:08,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 12:25:08,237 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:187, output treesize:235 [2018-04-11 12:25:09,270 WARN L148 SmtUtils]: Spent 966ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-11 12:25:09,290 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 118 [2018-04-11 12:25:09,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:09,293 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 103 treesize of output 110 [2018-04-11 12:25:09,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:09,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:09,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 100 [2018-04-11 12:25:09,355 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:09,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:09,545 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 115 treesize of output 96 [2018-04-11 12:25:09,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:09,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 52 [2018-04-11 12:25:09,554 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:09,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:09,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 91 [2018-04-11 12:25:09,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:09,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 52 [2018-04-11 12:25:09,722 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:09,742 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:09,745 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 97 treesize of output 81 [2018-04-11 12:25:09,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:09,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2018-04-11 12:25:09,749 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:09,757 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:09,896 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 129 [2018-04-11 12:25:09,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:09,900 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 125 treesize of output 132 [2018-04-11 12:25:09,900 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:09,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:09,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 99 treesize of output 126 [2018-04-11 12:25:09,988 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-11 12:25:10,059 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:10,233 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 136 [2018-04-11 12:25:10,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:10,236 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 127 treesize of output 134 [2018-04-11 12:25:10,237 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:10,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:10,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 128 [2018-04-11 12:25:10,321 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-04-11 12:25:10,379 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:10,384 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 108 treesize of output 109 [2018-04-11 12:25:10,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:10,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 51 [2018-04-11 12:25:10,392 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:10,406 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:10,540 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 84 treesize of output 77 [2018-04-11 12:25:10,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:10,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:10,543 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:25:10,552 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 23 treesize of output 36 [2018-04-11 12:25:10,552 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:10,564 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:10,579 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 109 [2018-04-11 12:25:10,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:10,582 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 99 treesize of output 106 [2018-04-11 12:25:10,582 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:10,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:10,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 96 [2018-04-11 12:25:10,636 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:10,667 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:10,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2018-04-11 12:25:10,777 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 15 variables, input treesize:338, output treesize:571 [2018-04-11 12:25:11,865 WARN L151 SmtUtils]: Spent 778ms on a formula simplification. DAG size of input: 157 DAG size of output 86 [2018-04-11 12:25:11,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 242 treesize of output 169 [2018-04-11 12:25:11,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:11,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 148 [2018-04-11 12:25:11,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:11,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:11,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 156 [2018-04-11 12:25:11,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-11 12:25:12,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 131 [2018-04-11 12:25:12,022 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 12:25:12,092 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 127 treesize of output 84 [2018-04-11 12:25:12,092 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 78 [2018-04-11 12:25:12,093 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,170 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 117 treesize of output 74 [2018-04-11 12:25:12,170 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,185 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 135 treesize of output 92 [2018-04-11 12:25:12,186 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 12:25:12,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 139 [2018-04-11 12:25:12,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:12,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 113 [2018-04-11 12:25:12,300 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:12,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 89 [2018-04-11 12:25:12,329 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,354 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 107 treesize of output 72 [2018-04-11 12:25:12,355 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,379 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 72 treesize of output 65 [2018-04-11 12:25:12,380 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:12,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 79 [2018-04-11 12:25:12,409 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 12:25:12,440 INFO L267 ElimStorePlain]: Start of recursive call 10: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 12:25:12,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 84 [2018-04-11 12:25:12,526 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 80 treesize of output 64 [2018-04-11 12:25:12,527 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,555 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 64 treesize of output 49 [2018-04-11 12:25:12,555 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,584 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 49 treesize of output 44 [2018-04-11 12:25:12,585 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:12,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2018-04-11 12:25:12,615 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:12,638 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 47 treesize of output 40 [2018-04-11 12:25:12,639 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,652 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 66 [2018-04-11 12:25:12,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:12,661 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-04-11 12:25:12,661 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,682 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 58 treesize of output 43 [2018-04-11 12:25:12,682 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:12,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2018-04-11 12:25:12,729 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 4 xjuncts. [2018-04-11 12:25:12,755 INFO L267 ElimStorePlain]: Start of recursive call 22: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,758 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 84 treesize of output 68 [2018-04-11 12:25:12,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:12,761 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-04-11 12:25:12,761 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,771 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 19 treesize of output 3 [2018-04-11 12:25:12,772 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,780 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 5 treesize of output 1 [2018-04-11 12:25:12,780 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,786 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2018-04-11 12:25:12,862 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 49 treesize of output 34 [2018-04-11 12:25:12,862 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:12,881 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 53 treesize of output 46 [2018-04-11 12:25:12,881 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:12,897 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 34 treesize of output 22 [2018-04-11 12:25:12,898 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,911 INFO L267 ElimStorePlain]: Start of recursive call 30: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,914 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 65 treesize of output 53 [2018-04-11 12:25:12,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:12,917 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 24 treesize of output 17 [2018-04-11 12:25:12,917 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:12,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 12:25:12,926 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,932 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 1 [2018-04-11 12:25:12,932 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,936 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 65 [2018-04-11 12:25:12,943 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 57 treesize of output 42 [2018-04-11 12:25:12,943 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,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 61 treesize of output 54 [2018-04-11 12:25:12,965 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:12,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:12,984 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2018-04-11 12:25:12,985 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:13,003 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-04-11 12:25:13,004 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:13,017 INFO L267 ElimStorePlain]: Start of recursive call 38: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:13,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-04-11 12:25:13,057 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 11 variables, input treesize:427, output treesize:109 [2018-04-11 12:25:13,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:13,123 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:25:13,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 38 [2018-04-11 12:25:13,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 12:25:13,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 12:25:13,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1277, Unknown=1, NotChecked=0, Total=1482 [2018-04-11 12:25:13,124 INFO L87 Difference]: Start difference. First operand 357 states and 399 transitions. Second operand 39 states. [2018-04-11 12:25:14,259 WARN L151 SmtUtils]: Spent 431ms on a formula simplification. DAG size of input: 85 DAG size of output 78 [2018-04-11 12:25:15,113 WARN L151 SmtUtils]: Spent 631ms on a formula simplification. DAG size of input: 104 DAG size of output 62 [2018-04-11 12:25:15,874 WARN L151 SmtUtils]: Spent 578ms on a formula simplification. DAG size of input: 111 DAG size of output 66 [2018-04-11 12:25:16,559 WARN L151 SmtUtils]: Spent 504ms on a formula simplification. DAG size of input: 116 DAG size of output 69 [2018-04-11 12:25:17,334 WARN L151 SmtUtils]: Spent 629ms on a formula simplification. DAG size of input: 111 DAG size of output 65 [2018-04-11 12:25:17,878 WARN L151 SmtUtils]: Spent 454ms on a formula simplification. DAG size of input: 64 DAG size of output 57 [2018-04-11 12:25:18,571 WARN L151 SmtUtils]: Spent 511ms on a formula simplification. DAG size of input: 112 DAG size of output 68 [2018-04-11 12:25:19,373 WARN L151 SmtUtils]: Spent 669ms on a formula simplification. DAG size of input: 120 DAG size of output 74 [2018-04-11 12:25:20,159 WARN L151 SmtUtils]: Spent 547ms on a formula simplification. DAG size of input: 119 DAG size of output 71 [2018-04-11 12:25:21,165 WARN L151 SmtUtils]: Spent 719ms on a formula simplification. DAG size of input: 141 DAG size of output 81 [2018-04-11 12:25:22,124 WARN L151 SmtUtils]: Spent 696ms on a formula simplification. DAG size of input: 127 DAG size of output 77 [2018-04-11 12:25:23,274 WARN L151 SmtUtils]: Spent 1081ms on a formula simplification. DAG size of input: 173 DAG size of output 90 [2018-04-11 12:25:24,229 WARN L151 SmtUtils]: Spent 620ms on a formula simplification. DAG size of input: 148 DAG size of output 84 [2018-04-11 12:25:25,413 WARN L151 SmtUtils]: Spent 1105ms on a formula simplification. DAG size of input: 180 DAG size of output 93 [2018-04-11 12:25:26,534 WARN L151 SmtUtils]: Spent 950ms on a formula simplification. DAG size of input: 186 DAG size of output 99 [2018-04-11 12:25:27,632 WARN L151 SmtUtils]: Spent 424ms on a formula simplification. DAG size of input: 71 DAG size of output 62 [2018-04-11 12:25:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:25:28,092 INFO L93 Difference]: Finished difference Result 445 states and 488 transitions. [2018-04-11 12:25:28,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 12:25:28,092 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 56 [2018-04-11 12:25:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:25:28,093 INFO L225 Difference]: With dead ends: 445 [2018-04-11 12:25:28,093 INFO L226 Difference]: Without dead ends: 445 [2018-04-11 12:25:28,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=1293, Invalid=4406, Unknown=1, NotChecked=0, Total=5700 [2018-04-11 12:25:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-04-11 12:25:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 367. [2018-04-11 12:25:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-04-11 12:25:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 410 transitions. [2018-04-11 12:25:28,097 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 410 transitions. Word has length 56 [2018-04-11 12:25:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:25:28,097 INFO L459 AbstractCegarLoop]: Abstraction has 367 states and 410 transitions. [2018-04-11 12:25:28,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 12:25:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 410 transitions. [2018-04-11 12:25:28,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 12:25:28,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:25:28,098 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:25:28,098 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:25:28,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1959498625, now seen corresponding path program 1 times [2018-04-11 12:25:28,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:25:28,098 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:25:28,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:28,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:28,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:28,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:25:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:28,397 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:25:28,397 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:25:28,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:28,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:25:28,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:28,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:28,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:25:28,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 12:25:28,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:25:28,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:25:28,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 12:25:28,499 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-11 12:25:28,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:28,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:28,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 12:25:28,540 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 29 treesize of output 19 [2018-04-11 12:25:28,542 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 1 [2018-04-11 12:25:28,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,545 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 12 treesize of output 4 [2018-04-11 12:25:28,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,550 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:17 [2018-04-11 12:25:28,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 12:25:28,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 8 treesize of output 7 [2018-04-11 12:25:28,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-11 12:25:28,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:28,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:28,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:28,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 12:25:28,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2018-04-11 12:25:28,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:25:28,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:25:28,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,685 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 26 treesize of output 25 [2018-04-11 12:25:28,687 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 14 treesize of output 7 [2018-04-11 12:25:28,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2018-04-11 12:25:28,750 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-04-11 12:25:28,752 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-11 12:25:28,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,766 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 29 treesize of output 30 [2018-04-11 12:25:28,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:28,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:28,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-04-11 12:25:28,806 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 50 treesize of output 36 [2018-04-11 12:25:28,807 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 1 [2018-04-11 12:25:28,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,812 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 29 treesize of output 18 [2018-04-11 12:25:28,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:28,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:28,820 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:27 [2018-04-11 12:25:29,692 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 34 treesize of output 31 [2018-04-11 12:25:29,704 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2018-04-11 12:25:29,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:29,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:29,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:29,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:34 [2018-04-11 12:25:30,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 19 [2018-04-11 12:25:30,940 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 19 treesize of output 11 [2018-04-11 12:25:30,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:30,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:30,949 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 48 treesize of output 40 [2018-04-11 12:25:30,950 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 24 treesize of output 15 [2018-04-11 12:25:30,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:30,958 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 1 case distinctions, treesize of input 20 treesize of output 17 [2018-04-11 12:25:30,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:30,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:30,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:30,968 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:63, output treesize:11 [2018-04-11 12:25:30,979 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:30,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:25:30,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2018-04-11 12:25:30,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 12:25:30,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 12:25:30,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1420, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 12:25:30,996 INFO L87 Difference]: Start difference. First operand 367 states and 410 transitions. Second operand 40 states. [2018-04-11 12:25:34,306 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 71 DAG size of output 57 [2018-04-11 12:25:36,178 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 42 DAG size of output 29 [2018-04-11 12:25:37,881 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 56 DAG size of output 41 [2018-04-11 12:25:38,279 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 56 DAG size of output 43 [2018-04-11 12:25:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:25:42,341 INFO L93 Difference]: Finished difference Result 565 states and 625 transitions. [2018-04-11 12:25:42,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 12:25:42,342 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 61 [2018-04-11 12:25:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:25:42,343 INFO L225 Difference]: With dead ends: 565 [2018-04-11 12:25:42,343 INFO L226 Difference]: Without dead ends: 565 [2018-04-11 12:25:42,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1610 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=811, Invalid=5669, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 12:25:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-04-11 12:25:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 385. [2018-04-11 12:25:42,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-11 12:25:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 434 transitions. [2018-04-11 12:25:42,347 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 434 transitions. Word has length 61 [2018-04-11 12:25:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:25:42,347 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 434 transitions. [2018-04-11 12:25:42,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 12:25:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 434 transitions. [2018-04-11 12:25:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 12:25:42,348 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:25:42,348 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:25:42,348 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:25:42,348 INFO L82 PathProgramCache]: Analyzing trace with hash 426787439, now seen corresponding path program 1 times [2018-04-11 12:25:42,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:25:42,348 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:25:42,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:42,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:42,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:42,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:25:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:42,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:25:42,670 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:25:42,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:42,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:25:42,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:42,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:42,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:25:42,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 12:25:42,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:25:42,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:25:42,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-11 12:25:42,777 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-11 12:25:42,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:42,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:42,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-11 12:25:42,853 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-11 12:25:42,859 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-11 12:25:42,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:42,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:42,883 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-11 12:25:42,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 12:25:42,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-04-11 12:25:42,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 12:25:42,892 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,896 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:42,906 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-11 12:25:42,907 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:68, output treesize:92 [2018-04-11 12:25:43,015 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-04-11 12:25:43,016 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 12:25:43,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:43,021 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 19 treesize of output 3 [2018-04-11 12:25:43,021 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:43,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:43,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 12:25:43,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 12:25:43,034 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:43,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 12:25:43,037 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:43,038 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:43,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:43,040 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2018-04-11 12:25:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:43,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:25:43,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 34 [2018-04-11 12:25:43,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 12:25:43,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 12:25:43,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1016, Unknown=3, NotChecked=0, Total=1122 [2018-04-11 12:25:43,077 INFO L87 Difference]: Start difference. First operand 385 states and 434 transitions. Second operand 34 states. [2018-04-11 12:25:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:25:45,259 INFO L93 Difference]: Finished difference Result 447 states and 494 transitions. [2018-04-11 12:25:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 12:25:45,259 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2018-04-11 12:25:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:25:45,260 INFO L225 Difference]: With dead ends: 447 [2018-04-11 12:25:45,260 INFO L226 Difference]: Without dead ends: 447 [2018-04-11 12:25:45,260 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=709, Invalid=3840, Unknown=7, NotChecked=0, Total=4556 [2018-04-11 12:25:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-04-11 12:25:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 387. [2018-04-11 12:25:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-04-11 12:25:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 436 transitions. [2018-04-11 12:25:45,263 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 436 transitions. Word has length 62 [2018-04-11 12:25:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:25:45,263 INFO L459 AbstractCegarLoop]: Abstraction has 387 states and 436 transitions. [2018-04-11 12:25:45,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 12:25:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 436 transitions. [2018-04-11 12:25:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 12:25:45,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:25:45,264 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, 1, 1] [2018-04-11 12:25:45,264 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:25:45,264 INFO L82 PathProgramCache]: Analyzing trace with hash 362823375, now seen corresponding path program 1 times [2018-04-11 12:25:45,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:25:45,264 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:25:45,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:45,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:45,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:45,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:25:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:25:45,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:25:45,347 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:25:45,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:45,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:25:45,405 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 17 treesize of output 13 [2018-04-11 12:25:45,406 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 13 treesize of output 5 [2018-04-11 12:25:45,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:45,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:45,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:45,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-11 12:25:45,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:45,429 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 17 [2018-04-11 12:25:45,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:45,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:45,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:45,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:25:45,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:45,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:45,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-04-11 12:25:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:25:45,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:25:45,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-11 12:25:45,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 12:25:45,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 12:25:45,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-04-11 12:25:45,511 INFO L87 Difference]: Start difference. First operand 387 states and 436 transitions. Second operand 16 states. [2018-04-11 12:25:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:25:46,618 INFO L93 Difference]: Finished difference Result 418 states and 463 transitions. [2018-04-11 12:25:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 12:25:46,619 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 64 [2018-04-11 12:25:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:25:46,620 INFO L225 Difference]: With dead ends: 418 [2018-04-11 12:25:46,620 INFO L226 Difference]: Without dead ends: 418 [2018-04-11 12:25:46,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2018-04-11 12:25:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-11 12:25:46,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 329. [2018-04-11 12:25:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-04-11 12:25:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 363 transitions. [2018-04-11 12:25:46,622 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 363 transitions. Word has length 64 [2018-04-11 12:25:46,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:25:46,622 INFO L459 AbstractCegarLoop]: Abstraction has 329 states and 363 transitions. [2018-04-11 12:25:46,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 12:25:46,622 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 363 transitions. [2018-04-11 12:25:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 12:25:46,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:25:46,623 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 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-11 12:25:46,623 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:25:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash 905148166, now seen corresponding path program 1 times [2018-04-11 12:25:46,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:25:46,623 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:25:46,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:46,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:46,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:46,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:25:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:46,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:25:46,949 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:25:46,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:46,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:25:46,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:46,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:46,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:25:46,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:46,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:46,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 12:25:47,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:25:47,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:25:47,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:25:47,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:25:47,027 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-11 12:25:47,079 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-11 12:25:47,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:47,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,102 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-11 12:25:47,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:47,103 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,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-11 12:25:47,118 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2018-04-11 12:25:47,240 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 45 [2018-04-11 12:25:47,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 12:25:47,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:47,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:47,284 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 91 treesize of output 86 [2018-04-11 12:25:47,291 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-11 12:25:47,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:47,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:47,309 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 87 treesize of output 82 [2018-04-11 12:25:47,310 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:25:47,311 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-11 12:25:47,311 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,320 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,348 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-11 12:25:47,348 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:92, output treesize:155 [2018-04-11 12:25:47,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:47,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:47,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:47,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 12:25:47,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:83 [2018-04-11 12:25:47,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-04-11 12:25:47,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2018-04-11 12:25:47,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-11 12:25:47,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2018-04-11 12:25:47,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:81 [2018-04-11 12:25:47,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:47,556 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 77 treesize of output 78 [2018-04-11 12:25:47,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:47,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:47,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:47,581 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 92 treesize of output 108 [2018-04-11 12:25:47,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:47,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,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-11 12:25:47,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:95 [2018-04-11 12:25:47,870 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-11 12:25:47,877 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-11 12:25:47,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:47,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:47,934 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:25:47,934 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-11 12:25:47,936 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-11 12:25:47,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,948 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-11 12:25:47,950 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:25:47,951 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-11 12:25:47,951 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,964 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:47,996 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-11 12:25:47,997 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:203, output treesize:293 [2018-04-11 12:25:48,576 WARN L148 SmtUtils]: Spent 422ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 12:25:48,975 WARN L148 SmtUtils]: Spent 348ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 12:25:48,987 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 139 treesize of output 126 [2018-04-11 12:25:48,989 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 77 treesize of output 62 [2018-04-11 12:25:48,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:48,999 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 1 [2018-04-11 12:25:48,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:49,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:49,033 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 181 treesize of output 152 [2018-04-11 12:25:49,035 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 98 treesize of output 81 [2018-04-11 12:25:49,035 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:49,048 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 13 treesize of output 1 [2018-04-11 12:25:49,048 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:49,058 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:49,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-11 12:25:49,082 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:321, output treesize:202 [2018-04-11 12:25:49,267 WARN L148 SmtUtils]: Spent 146ms on a formula simplification that was a NOOP. DAG size: 66 [2018-04-11 12:25:49,442 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 66 [2018-04-11 12:25:49,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 64 [2018-04-11 12:25:49,451 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 31 treesize of output 28 [2018-04-11 12:25:49,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:49,465 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2018-04-11 12:25:49,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 12:25:49,477 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 34 treesize of output 23 [2018-04-11 12:25:49,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:49,478 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 40 treesize of output 29 [2018-04-11 12:25:49,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:49,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 12:25:49,513 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 92 treesize of output 57 [2018-04-11 12:25:49,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 12:25:49,515 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:49,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-11 12:25:49,521 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:49,525 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 20 treesize of output 14 [2018-04-11 12:25:49,526 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:49,530 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:49,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 12:25:49,548 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:204, output treesize:85 [2018-04-11 12:25:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:49,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:25:49,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2018-04-11 12:25:49,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 12:25:49,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 12:25:49,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 12:25:49,714 INFO L87 Difference]: Start difference. First operand 329 states and 363 transitions. Second operand 39 states. [2018-04-11 12:25:50,849 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 73 DAG size of output 53 [2018-04-11 12:25:51,599 WARN L151 SmtUtils]: Spent 712ms on a formula simplification. DAG size of input: 61 DAG size of output 61 [2018-04-11 12:25:52,463 WARN L151 SmtUtils]: Spent 621ms on a formula simplification. DAG size of input: 104 DAG size of output 60 [2018-04-11 12:25:53,435 WARN L151 SmtUtils]: Spent 689ms on a formula simplification. DAG size of input: 121 DAG size of output 63 [2018-04-11 12:25:54,281 WARN L151 SmtUtils]: Spent 752ms on a formula simplification. DAG size of input: 149 DAG size of output 107 [2018-04-11 12:25:54,897 WARN L148 SmtUtils]: Spent 562ms on a formula simplification that was a NOOP. DAG size: 112 [2018-04-11 12:25:56,097 WARN L151 SmtUtils]: Spent 1019ms on a formula simplification. DAG size of input: 129 DAG size of output 115 [2018-04-11 12:25:57,090 WARN L151 SmtUtils]: Spent 695ms on a formula simplification. DAG size of input: 73 DAG size of output 59 [2018-04-11 12:25:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:25:57,289 INFO L93 Difference]: Finished difference Result 525 states and 574 transitions. [2018-04-11 12:25:57,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 12:25:57,289 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 65 [2018-04-11 12:25:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:25:57,290 INFO L225 Difference]: With dead ends: 525 [2018-04-11 12:25:57,290 INFO L226 Difference]: Without dead ends: 525 [2018-04-11 12:25:57,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=491, Invalid=3799, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 12:25:57,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-04-11 12:25:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 339. [2018-04-11 12:25:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-04-11 12:25:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 376 transitions. [2018-04-11 12:25:57,293 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 376 transitions. Word has length 65 [2018-04-11 12:25:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:25:57,293 INFO L459 AbstractCegarLoop]: Abstraction has 339 states and 376 transitions. [2018-04-11 12:25:57,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 12:25:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 376 transitions. [2018-04-11 12:25:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 12:25:57,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:25:57,294 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 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-11 12:25:57,294 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:25:57,294 INFO L82 PathProgramCache]: Analyzing trace with hash 905148167, now seen corresponding path program 1 times [2018-04-11 12:25:57,294 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:25:57,294 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:25:57,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:57,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:57,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:25:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:57,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:25:57,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:57,690 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:25:57,690 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:25:57,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:25:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:25:57,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:25:57,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:57,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:57,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 12:25:57,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 12:25:57,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:25:57,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:25:57,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:25:57,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:25:57,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:20 [2018-04-11 12:25:57,761 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 47 [2018-04-11 12:25:57,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:57,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2018-04-11 12:25:57,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:57,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:57,782 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:62, output treesize:46 [2018-04-11 12:25:57,857 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-11 12:25:57,865 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-11 12:25:57,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:57,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:57,894 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-11 12:25:57,900 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-11 12:25:57,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:57,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:57,922 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-11 12:25:57,923 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:25:57,924 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-11 12:25:57,924 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,931 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:57,952 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-11 12:25:57,953 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:133 [2018-04-11 12:25:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 12:25:58,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:58,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:58,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:58,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 12:25:58,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-04-11 12:25:58,048 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:25:58,050 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 60 [2018-04-11 12:25:58,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-11 12:25:58,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-11 12:25:58,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-11 12:25:58,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,083 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:71 [2018-04-11 12:25:58,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:58,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:58,143 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 102 treesize of output 118 [2018-04-11 12:25:58,145 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-11 12:25:58,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:25:58,170 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-11 12:25:58,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:25:58,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:58,189 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:113, output treesize:89 [2018-04-11 12:25:58,450 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-11 12:25:58,457 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-11 12:25:58,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:58,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:58,511 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-11 12:25:58,517 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-11 12:25:58,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:58,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:58,544 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-11 12:25:58,546 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-11 12:25:58,546 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,554 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:58,582 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-11 12:25:58,583 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:197, output treesize:285 [2018-04-11 12:25:58,993 WARN L148 SmtUtils]: Spent 370ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-11 12:25:59,368 WARN L148 SmtUtils]: Spent 327ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-11 12:25:59,596 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 149 treesize of output 109 [2018-04-11 12:25:59,598 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-11 12:25:59,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-04-11 12:25:59,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:59,616 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 1 [2018-04-11 12:25:59,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:59,647 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 81 treesize of output 48 [2018-04-11 12:25:59,649 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 1 [2018-04-11 12:25:59,649 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-04-11 12:25:59,655 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,665 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-11 12:25:59,665 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,669 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,688 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 195 treesize of output 126 [2018-04-11 12:25:59,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 12:25:59,693 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-11 12:25:59,706 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 50 treesize of output 37 [2018-04-11 12:25:59,707 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-04-11 12:25:59,708 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:25:59,726 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 105 treesize of output 66 [2018-04-11 12:25:59,727 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,728 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 99 treesize of output 60 [2018-04-11 12:25:59,728 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,749 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 12:25:59,775 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 66 treesize of output 52 [2018-04-11 12:25:59,776 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 24 treesize of output 19 [2018-04-11 12:25:59,776 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,785 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 19 treesize of output 3 [2018-04-11 12:25:59,785 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,792 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 5 treesize of output 1 [2018-04-11 12:25:59,792 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,797 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,800 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 60 treesize of output 46 [2018-04-11 12:25:59,802 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-11 12:25:59,802 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,809 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 9 treesize of output 1 [2018-04-11 12:25:59,809 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 12:25:59,815 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,819 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:25:59,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:25:59,834 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 11 variables, input treesize:345, output treesize:23 [2018-04-11 12:25:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:25:59,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:25:59,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 35 [2018-04-11 12:25:59,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 12:25:59,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 12:25:59,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 12:25:59,895 INFO L87 Difference]: Start difference. First operand 339 states and 376 transitions. Second operand 36 states. [2018-04-11 12:26:02,000 WARN L151 SmtUtils]: Spent 821ms on a formula simplification. DAG size of input: 65 DAG size of output 63 [2018-04-11 12:26:02,902 WARN L151 SmtUtils]: Spent 763ms on a formula simplification. DAG size of input: 102 DAG size of output 63 [2018-04-11 12:26:03,881 WARN L151 SmtUtils]: Spent 652ms on a formula simplification. DAG size of input: 142 DAG size of output 123 [2018-04-11 12:26:04,334 WARN L148 SmtUtils]: Spent 401ms on a formula simplification that was a NOOP. DAG size: 123 [2018-04-11 12:26:04,899 WARN L148 SmtUtils]: Spent 322ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-11 12:26:05,333 WARN L148 SmtUtils]: Spent 377ms on a formula simplification that was a NOOP. DAG size: 128 [2018-04-11 12:26:06,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:06,009 INFO L93 Difference]: Finished difference Result 529 states and 578 transitions. [2018-04-11 12:26:06,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 12:26:06,010 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2018-04-11 12:26:06,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:06,010 INFO L225 Difference]: With dead ends: 529 [2018-04-11 12:26:06,011 INFO L226 Difference]: Without dead ends: 529 [2018-04-11 12:26:06,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=392, Invalid=3268, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 12:26:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-04-11 12:26:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 339. [2018-04-11 12:26:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-04-11 12:26:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 375 transitions. [2018-04-11 12:26:06,014 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 375 transitions. Word has length 65 [2018-04-11 12:26:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:06,014 INFO L459 AbstractCegarLoop]: Abstraction has 339 states and 375 transitions. [2018-04-11 12:26:06,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 12:26:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 375 transitions. [2018-04-11 12:26:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 12:26:06,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:06,015 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, 1, 1, 1, 1, 1] [2018-04-11 12:26:06,015 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1561393262, now seen corresponding path program 1 times [2018-04-11 12:26:06,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:06,016 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:06,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:06,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:06,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:06,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:26:06,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:06,148 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:26:06,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:06,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:06,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:06,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:06,290 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 15 treesize of output 8 [2018-04-11 12:26:06,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:06,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:30 [2018-04-11 12:26:06,336 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 48 [2018-04-11 12:26:06,337 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 39 treesize of output 38 [2018-04-11 12:26:06,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,360 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 33 [2018-04-11 12:26:06,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:06,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:06,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:06,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 12:26:06,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:26:06,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 12:26:06,405 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:52, output treesize:78 [2018-04-11 12:26:06,439 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 28 treesize of output 27 [2018-04-11 12:26:06,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:06,442 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 16 treesize of output 23 [2018-04-11 12:26:06,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,458 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 28 treesize of output 27 [2018-04-11 12:26:06,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:06,462 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 16 treesize of output 23 [2018-04-11 12:26:06,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:06,474 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:51 [2018-04-11 12:26:06,504 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 77 [2018-04-11 12:26:06,505 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 23 treesize of output 3 [2018-04-11 12:26:06,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:06,512 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-11 12:26:06,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:06,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:06,522 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 34 treesize of output 28 [2018-04-11 12:26:06,523 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 19 treesize of output 3 [2018-04-11 12:26:06,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 12:26:06,526 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,527 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:06,529 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:101, output treesize:7 [2018-04-11 12:26:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:26:06,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:26:06,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-04-11 12:26:06,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 12:26:06,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 12:26:06,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-04-11 12:26:06,567 INFO L87 Difference]: Start difference. First operand 339 states and 375 transitions. Second operand 25 states. [2018-04-11 12:26:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:09,318 INFO L93 Difference]: Finished difference Result 413 states and 453 transitions. [2018-04-11 12:26:09,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 12:26:09,318 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-04-11 12:26:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:09,319 INFO L225 Difference]: With dead ends: 413 [2018-04-11 12:26:09,319 INFO L226 Difference]: Without dead ends: 413 [2018-04-11 12:26:09,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=430, Invalid=2325, Unknown=1, NotChecked=0, Total=2756 [2018-04-11 12:26:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-11 12:26:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 332. [2018-04-11 12:26:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-04-11 12:26:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 368 transitions. [2018-04-11 12:26:09,322 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 368 transitions. Word has length 67 [2018-04-11 12:26:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:09,322 INFO L459 AbstractCegarLoop]: Abstraction has 332 states and 368 transitions. [2018-04-11 12:26:09,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 12:26:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 368 transitions. [2018-04-11 12:26:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 12:26:09,323 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:09,323 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 12:26:09,323 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:09,323 INFO L82 PathProgramCache]: Analyzing trace with hash -179558291, now seen corresponding path program 2 times [2018-04-11 12:26:09,323 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:09,323 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:09,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:09,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:09,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:09,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:09,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:09,823 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:26:09,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 12:26:09,850 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 12:26:09,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:26:09,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:09,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:09,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:09,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:26:09,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:09,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:09,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 12:26:09,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:26:09,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:26:09,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:09,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:09,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:09,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 12:26:09,947 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-11 12:26:09,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:26:09,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:09,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:09,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:09,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-11 12:26:10,046 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 49 treesize of output 44 [2018-04-11 12:26:10,053 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-11 12:26:10,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:10,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:10,081 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-11 12:26:10,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:82 [2018-04-11 12:26:10,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 12:26:10,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:53 [2018-04-11 12:26:10,175 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 43 treesize of output 42 [2018-04-11 12:26:10,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 12:26:10,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:54 [2018-04-11 12:26:10,252 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 58 treesize of output 66 [2018-04-11 12:26:10,253 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-11 12:26:10,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:10,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:63 [2018-04-11 12:26:10,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-04-11 12:26:10,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 2 case distinctions, treesize of input 20 treesize of output 27 [2018-04-11 12:26:10,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:10,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:10,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 12:26:10,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:115, output treesize:168 [2018-04-11 12:26:10,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 83 [2018-04-11 12:26:10,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:10,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:106 [2018-04-11 12:26:10,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 94 [2018-04-11 12:26:10,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 12:26:10,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:10,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:115 [2018-04-11 12:26:10,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:10,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 127 [2018-04-11 12:26:10,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:26:10,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:10,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:10,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:136, output treesize:128 [2018-04-11 12:26:11,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 128 [2018-04-11 12:26:11,065 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 36 treesize of output 55 [2018-04-11 12:26:11,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:11,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:11,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-11 12:26:11,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:208, output treesize:358 [2018-04-11 12:26:11,357 WARN L148 SmtUtils]: Spent 166ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-11 12:26:11,590 WARN L148 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 75 [2018-04-11 12:26:11,839 WARN L148 SmtUtils]: Spent 173ms on a formula simplification that was a NOOP. DAG size: 76 [2018-04-11 12:26:11,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 109 [2018-04-11 12:26:11,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 12:26:11,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:11,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-11 12:26:11,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:11,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-04-11 12:26:11,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:11,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 12:26:11,888 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:11,908 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:26:11,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-04-11 12:26:11,909 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:11,910 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:26:11,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-11 12:26:11,911 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:11,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 12:26:11,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 102 [2018-04-11 12:26:11,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-11 12:26:11,983 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:11,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-04-11 12:26:11,998 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:12,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:26:12,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-04-11 12:26:12,021 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:12,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-04-11 12:26:12,041 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:12,050 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:12,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-11 12:26:12,095 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:378, output treesize:136 [2018-04-11 12:26:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:12,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:26:12,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 55 [2018-04-11 12:26:12,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 12:26:12,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 12:26:12,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2674, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 12:26:12,257 INFO L87 Difference]: Start difference. First operand 332 states and 368 transitions. Second operand 56 states. [2018-04-11 12:26:13,247 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 56 DAG size of output 44 [2018-04-11 12:26:13,492 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-04-11 12:26:14,322 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 64 DAG size of output 59 [2018-04-11 12:26:14,502 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 62 DAG size of output 57 [2018-04-11 12:26:15,237 WARN L151 SmtUtils]: Spent 458ms on a formula simplification. DAG size of input: 101 DAG size of output 98 [2018-04-11 12:26:15,970 WARN L151 SmtUtils]: Spent 477ms on a formula simplification. DAG size of input: 112 DAG size of output 106 [2018-04-11 12:26:16,451 WARN L151 SmtUtils]: Spent 434ms on a formula simplification. DAG size of input: 147 DAG size of output 81 [2018-04-11 12:26:17,571 WARN L151 SmtUtils]: Spent 547ms on a formula simplification. DAG size of input: 173 DAG size of output 84 [2018-04-11 12:26:18,001 WARN L148 SmtUtils]: Spent 233ms on a formula simplification that was a NOOP. DAG size: 78 [2018-04-11 12:26:18,473 WARN L148 SmtUtils]: Spent 235ms on a formula simplification that was a NOOP. DAG size: 86 [2018-04-11 12:26:19,078 WARN L151 SmtUtils]: Spent 483ms on a formula simplification. DAG size of input: 104 DAG size of output 81 [2018-04-11 12:26:19,981 WARN L151 SmtUtils]: Spent 354ms on a formula simplification. DAG size of input: 81 DAG size of output 81 [2018-04-11 12:26:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:20,187 INFO L93 Difference]: Finished difference Result 687 states and 754 transitions. [2018-04-11 12:26:20,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-11 12:26:20,188 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 70 [2018-04-11 12:26:20,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:20,189 INFO L225 Difference]: With dead ends: 687 [2018-04-11 12:26:20,189 INFO L226 Difference]: Without dead ends: 687 [2018-04-11 12:26:20,190 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4240 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1876, Invalid=11230, Unknown=4, NotChecked=0, Total=13110 [2018-04-11 12:26:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-04-11 12:26:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 403. [2018-04-11 12:26:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-11 12:26:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 447 transitions. [2018-04-11 12:26:20,194 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 447 transitions. Word has length 70 [2018-04-11 12:26:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:20,194 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 447 transitions. [2018-04-11 12:26:20,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 12:26:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 447 transitions. [2018-04-11 12:26:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 12:26:20,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:20,195 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 12:26:20,195 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:20,195 INFO L82 PathProgramCache]: Analyzing trace with hash -179558290, now seen corresponding path program 2 times [2018-04-11 12:26:20,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:20,195 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:20,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:20,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:26:20,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:20,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:21,123 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:21,123 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:26:21,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 12:26:21,153 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 12:26:21,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:26:21,156 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:21,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:21,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:21,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:26:21,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 12:26:21,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:26:21,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:26:21,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:26:21,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:26:21,276 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,286 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-11 12:26:21,344 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-11 12:26:21,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:26:21,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,365 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-11 12:26:21,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:26:21,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:21,380 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2018-04-11 12:26:21,490 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 62 treesize of output 57 [2018-04-11 12:26:21,497 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-11 12:26:21,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:21,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:21,539 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 68 treesize of output 69 [2018-04-11 12:26:21,541 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:26:21,541 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 28 [2018-04-11 12:26:21,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,552 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:26:21,554 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 64 treesize of output 64 [2018-04-11 12:26:21,555 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 20 [2018-04-11 12:26:21,556 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,563 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,585 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-11 12:26:21,585 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:91, output treesize:143 [2018-04-11 12:26:21,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:21,682 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 21 [2018-04-11 12:26:21,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:21,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:21,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:21,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 12:26:21,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:90 [2018-04-11 12:26:21,773 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 65 treesize of output 64 [2018-04-11 12:26:21,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 12:26:21,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-04-11 12:26:21,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-04-11 12:26:21,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:117, output treesize:84 [2018-04-11 12:26:21,912 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 99 treesize of output 107 [2018-04-11 12:26:21,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 12:26:21,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,942 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 29 treesize of output 30 [2018-04-11 12:26:21,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:26:21,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:21,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:21,962 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:126, output treesize:106 [2018-04-11 12:26:22,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 125 [2018-04-11 12:26:22,132 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 27 [2018-04-11 12:26:22,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:22,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:22,199 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 141 treesize of output 136 [2018-04-11 12:26:22,206 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-11 12:26:22,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:22,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:22,246 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 133 treesize of output 128 [2018-04-11 12:26:22,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 0 case distinctions, treesize of input 24 treesize of output 21 [2018-04-11 12:26:22,249 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,264 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,317 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-11 12:26:22,317 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:172, output treesize:283 [2018-04-11 12:26:22,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:22,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:22,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:22,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:22,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-04-11 12:26:22,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 66 [2018-04-11 12:26:22,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:22,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:137, output treesize:128 [2018-04-11 12:26:22,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:22,504 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 113 treesize of output 107 [2018-04-11 12:26:22,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 12:26:22,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,540 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 34 treesize of output 44 [2018-04-11 12:26:22,542 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 15 [2018-04-11 12:26:22,542 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:22,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:150, output treesize:122 [2018-04-11 12:26:22,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:22,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 154 [2018-04-11 12:26:22,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 13 [2018-04-11 12:26:22,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,713 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 29 treesize of output 30 [2018-04-11 12:26:22,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:26:22,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:22,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:22,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:164, output treesize:140 [2018-04-11 12:26:22,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 162 [2018-04-11 12:26:22,935 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 36 treesize of output 55 [2018-04-11 12:26:22,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:22,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:23,015 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 225 treesize of output 196 [2018-04-11 12:26:23,017 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 25 [2018-04-11 12:26:23,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:23,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:23,036 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 249 treesize of output 220 [2018-04-11 12:26:23,043 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 47 [2018-04-11 12:26:23,043 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:23,065 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:23,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-11 12:26:23,118 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:271, output treesize:433 [2018-04-11 12:26:23,377 WARN L148 SmtUtils]: Spent 179ms on a formula simplification that was a NOOP. DAG size: 90 [2018-04-11 12:26:23,644 WARN L148 SmtUtils]: Spent 181ms on a formula simplification that was a NOOP. DAG size: 90 [2018-04-11 12:26:24,036 WARN L148 SmtUtils]: Spent 302ms on a formula simplification that was a NOOP. DAG size: 91 [2018-04-11 12:26:24,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 127 [2018-04-11 12:26:24,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-04-11 12:26:24,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:24,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 12:26:24,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,085 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:26:24,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-04-11 12:26:24,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 12:26:24,101 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:24,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:24,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-04-11 12:26:24,158 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 11 treesize of output 7 [2018-04-11 12:26:24,158 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,171 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 1 [2018-04-11 12:26:24,171 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,185 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 143 [2018-04-11 12:26:24,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-11 12:26:24,229 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 32 [2018-04-11 12:26:24,255 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 12:26:24,281 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:26:24,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-11 12:26:24,282 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,283 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:26:24,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-04-11 12:26:24,284 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2018-04-11 12:26:24,311 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:24,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 61 [2018-04-11 12:26:24,313 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:24,344 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 12:26:24,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-04-11 12:26:24,396 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 11 treesize of output 7 [2018-04-11 12:26:24,396 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,412 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 12:26:24,412 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,423 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2018-04-11 12:26:24,429 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 13 treesize of output 10 [2018-04-11 12:26:24,429 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:24,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 12:26:24,445 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:24,457 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:24,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 12:26:24,514 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 15 variables, input treesize:467, output treesize:94 [2018-04-11 12:26:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:24,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:26:24,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 61 [2018-04-11 12:26:24,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-11 12:26:24,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-11 12:26:24,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=3402, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 12:26:24,727 INFO L87 Difference]: Start difference. First operand 403 states and 447 transitions. Second operand 62 states. [2018-04-11 12:26:26,274 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 81 DAG size of output 66 [2018-04-11 12:26:27,549 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 95 DAG size of output 75 [2018-04-11 12:26:28,432 WARN L151 SmtUtils]: Spent 283ms on a formula simplification. DAG size of input: 121 DAG size of output 119 [2018-04-11 12:26:29,179 WARN L151 SmtUtils]: Spent 344ms on a formula simplification. DAG size of input: 126 DAG size of output 124 [2018-04-11 12:26:29,438 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 184 DAG size of output 105 [2018-04-11 12:26:30,462 WARN L151 SmtUtils]: Spent 376ms on a formula simplification. DAG size of input: 203 DAG size of output 112 [2018-04-11 12:26:31,320 WARN L151 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 115 DAG size of output 100 [2018-04-11 12:26:31,947 WARN L151 SmtUtils]: Spent 349ms on a formula simplification. DAG size of input: 126 DAG size of output 112 [2018-04-11 12:26:33,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:26:33,071 INFO L93 Difference]: Finished difference Result 714 states and 786 transitions. [2018-04-11 12:26:33,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-11 12:26:33,071 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 70 [2018-04-11 12:26:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:26:33,072 INFO L225 Difference]: With dead ends: 714 [2018-04-11 12:26:33,072 INFO L226 Difference]: Without dead ends: 714 [2018-04-11 12:26:33,073 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4499 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2041, Invalid=12479, Unknown=0, NotChecked=0, Total=14520 [2018-04-11 12:26:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-04-11 12:26:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 403. [2018-04-11 12:26:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-04-11 12:26:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 446 transitions. [2018-04-11 12:26:33,077 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 446 transitions. Word has length 70 [2018-04-11 12:26:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:26:33,077 INFO L459 AbstractCegarLoop]: Abstraction has 403 states and 446 transitions. [2018-04-11 12:26:33,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-11 12:26:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 446 transitions. [2018-04-11 12:26:33,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-11 12:26:33,078 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:26:33,078 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:26:33,078 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr71AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr72EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr70AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr68RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:26:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1005011080, now seen corresponding path program 1 times [2018-04-11 12:26:33,078 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:26:33,078 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:26:33,079 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:33,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:26:33,079 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:26:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:33,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:26:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:26:33,405 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:26:33,405 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 12:26:33,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:26:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:26:33,431 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:26:33,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:33,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:33,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 12:26:33,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 12:26:33,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:26:33,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:26:33,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 12:26:33,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:26:33,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,502 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-04-11 12:26:33,542 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-11 12:26:33,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:26:33,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 12:26:33,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:26:33,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:33,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2018-04-11 12:26:33,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-11 12:26:33,600 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 1 [2018-04-11 12:26:33,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-11 12:26:33,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:33,612 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:63, output treesize:31 [2018-04-11 12:26:33,657 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 28 treesize of output 27 [2018-04-11 12:26:33,671 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-11 12:26:33,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:26:33,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:26:33,688 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-11 12:26:33,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:68 [2018-04-11 12:26:33,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:33,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:33,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:26:33,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 12:26:33,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-04-11 12:26:33,749 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 26 treesize of output 25 [2018-04-11 12:26:33,751 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 14 treesize of output 7 [2018-04-11 12:26:33,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-04-11 12:26:33,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:26:33,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:28 [2018-04-11 12:26:33,815 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-04-11 12:26:33,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, 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-11 12:26:33,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,830 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 29 treesize of output 30 [2018-04-11 12:26:33,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:26:33,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:33,840 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-04-11 12:26:33,868 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 50 treesize of output 36 [2018-04-11 12:26:33,869 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 29 treesize of output 18 [2018-04-11 12:26:33,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,874 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 1 [2018-04-11 12:26:33,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,881 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:61, output treesize:12 [2018-04-11 12:26:33,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 12:26:33,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:26:33,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:26:33,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:26:33,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 Received shutdown request... [2018-04-11 12:26:33,999 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 12:26:33,999 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 12:26:34,003 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 12:26:34,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 12:26:34 BoogieIcfgContainer [2018-04-11 12:26:34,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 12:26:34,003 INFO L168 Benchmark]: Toolchain (without parser) took 200379.74 ms. Allocated memory was 400.0 MB in the beginning and 558.9 MB in the end (delta: 158.9 MB). Free memory was 334.3 MB in the beginning and 495.8 MB in the end (delta: -161.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 12:26:34,004 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 400.0 MB. Free memory is still 360.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 12:26:34,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.41 ms. Allocated memory is still 400.0 MB. Free memory was 333.0 MB in the beginning and 304.5 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. [2018-04-11 12:26:34,005 INFO L168 Benchmark]: Boogie Preprocessor took 49.23 ms. Allocated memory is still 400.0 MB. Free memory was 304.5 MB in the beginning and 301.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 12:26:34,005 INFO L168 Benchmark]: RCFGBuilder took 564.03 ms. Allocated memory was 400.0 MB in the beginning and 607.6 MB in the end (delta: 207.6 MB). Free memory was 301.9 MB in the beginning and 516.5 MB in the end (delta: -214.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-04-11 12:26:34,005 INFO L168 Benchmark]: TraceAbstraction took 199513.61 ms. Allocated memory was 607.6 MB in the beginning and 558.9 MB in the end (delta: -48.8 MB). Free memory was 516.5 MB in the beginning and 495.8 MB in the end (delta: 20.7 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 12:26:34,006 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 400.0 MB. Free memory is still 360.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.41 ms. Allocated memory is still 400.0 MB. Free memory was 333.0 MB in the beginning and 304.5 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.23 ms. Allocated memory is still 400.0 MB. Free memory was 304.5 MB in the beginning and 301.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 564.03 ms. Allocated memory was 400.0 MB in the beginning and 607.6 MB in the end (delta: 207.6 MB). Free memory was 301.9 MB in the beginning and 516.5 MB in the end (delta: -214.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 199513.61 ms. Allocated memory was 607.6 MB in the beginning and 558.9 MB in the end (delta: -48.8 MB). Free memory was 516.5 MB in the beginning and 495.8 MB in the end (delta: 20.7 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1067]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1068]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1036). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 983]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 983). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 989). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1032]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1032). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1068]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1068). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1033). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1067]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1067). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 35 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 73 error locations. TIMEOUT Result, 199.4s OverallTime, 34 OverallIterations, 4 TraceHistogramMax, 131.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4104 SDtfs, 27722 SDslu, 36676 SDs, 0 SdLazy, 45226 SolverSat, 4010 SolverUnsat, 80 SolverUnknown, 0 SolverNotchecked, 33.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2172 GetRequests, 833 SyntacticMatches, 30 SemanticMatches, 1309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25703 ImplicationChecksByTransitivity, 147.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=32, 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, 33 MinimizatonAttempts, 3342 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 65.1s InterpolantComputationTime, 2486 NumberOfCodeBlocks, 2486 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2435 ConstructedInterpolants, 401 QuantifiedInterpolants, 5235713 SizeOfPredicates, 311 NumberOfNonLiveVariables, 4088 ConjunctsInSsa, 769 ConjunctsInUnsatCore, 51 InterpolantComputations, 16 PerfectInterpolantSequences, 55/578 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_12-26-34-012.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-sorted_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_12-26-34-012.csv Completed graceful shutdown