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-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 12:13:03,162 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 12:13:03,163 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 12:13:03,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 12:13:03,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 12:13:03,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 12:13:03,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 12:13:03,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 12:13:03,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 12:13:03,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 12:13:03,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 12:13:03,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 12:13:03,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 12:13:03,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 12:13:03,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 12:13:03,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 12:13:03,189 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 12:13:03,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 12:13:03,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 12:13:03,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 12:13:03,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 12:13:03,194 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 12:13:03,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 12:13:03,195 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 12:13:03,196 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 12:13:03,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 12:13:03,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 12:13:03,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 12:13:03,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 12:13:03,199 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 12:13:03,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 12:13:03,199 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:13:03,221 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 12:13:03,221 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 12:13:03,222 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 12:13:03,222 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 12:13:03,222 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 12:13:03,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 12:13:03,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 12:13:03,223 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 12:13:03,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 12:13:03,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 12:13:03,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 12:13:03,223 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 12:13:03,224 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 12:13:03,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 12:13:03,224 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 12:13:03,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 12:13:03,224 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 12:13:03,224 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 12:13:03,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 12:13:03,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 12:13:03,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 12:13:03,225 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 12:13:03,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 12:13:03,225 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:13:03,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 12:13:03,269 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 12:13:03,272 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 12:13:03,273 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 12:13:03,273 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 12:13:03,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,652 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1e361204a [2018-04-11 12:13:03,790 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 12:13:03,791 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 12:13:03,791 INFO L168 CDTParser]: Scanning dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,799 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 12:13:03,799 INFO L215 ultiparseSymbolTable]: [2018-04-11 12:13:03,799 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 12:13:03,799 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,799 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 12:13:03,799 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____ino_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____pid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_long in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____ino64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____gid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__int64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____quad_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,800 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____sigset_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____off_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__fd_mask in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__SLL in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____key_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__ushort in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____u_long in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__dev_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____int16_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,801 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____clockid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__id_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____useconds_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__sigset_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__quad_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____u_int in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,802 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_char in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____caddr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____blksize_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__blksize_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____dev_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__fd_set in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,803 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____int64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__ulong in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__loff_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____uint8_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____daddr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__clock_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__mode_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____uint16_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__daddr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,804 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____int8_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____clock_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____loff_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__fsid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____time_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____timer_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__key_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____u_short in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__idtype_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,805 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____mode_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__int32_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____rlim_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__caddr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__ino_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__int8_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__gid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__time_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_short in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__div_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__off_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,806 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__register_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____socklen_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__uid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____uint32_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____intptr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__size_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____off64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____uint64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,807 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__int16_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__wchar_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__uint in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fsword_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____u_char in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__nlink_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____uid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__ssize_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____nlink_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,808 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__clockid_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_int in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____id_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____ssize_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__timer_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____fd_mask in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i____int32_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,809 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll____true_unreach_call_true_valid_memsafety_i__pthread_t in dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:03,851 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1e361204a [2018-04-11 12:13:03,854 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 12:13:03,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 12:13:03,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 12:13:03,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 12:13:03,859 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 12:13:03,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:13:03" (1/1) ... [2018-04-11 12:13:03,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd677f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:03, skipping insertion in model container [2018-04-11 12:13:03,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 12:13:03" (1/1) ... [2018-04-11 12:13:03,878 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:13:03,908 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 12:13:04,067 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:13:04,108 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 12:13:04,113 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 12:13:04,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:04 WrapperNode [2018-04-11 12:13:04,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 12:13:04,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 12:13:04,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 12:13:04,149 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 12:13:04,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:04" (1/1) ... [2018-04-11 12:13:04,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:04" (1/1) ... [2018-04-11 12:13:04,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:04" (1/1) ... [2018-04-11 12:13:04,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:04" (1/1) ... [2018-04-11 12:13:04,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:04" (1/1) ... [2018-04-11 12:13:04,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:04" (1/1) ... [2018-04-11 12:13:04,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:04" (1/1) ... [2018-04-11 12:13:04,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 12:13:04,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 12:13:04,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 12:13:04,198 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 12:13:04,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:04" (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:13:04,302 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 12:13:04,302 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 12:13:04,302 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 12:13:04,302 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 12:13:04,303 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 12:13:04,304 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 12:13:04,304 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 12:13:04,304 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 12:13:04,304 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 12:13:04,304 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 12:13:04,304 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 12:13:04,304 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 12:13:04,304 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 12:13:04,304 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 12:13:04,305 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 12:13:04,305 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 12:13:04,305 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 12:13:04,305 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 12:13:04,305 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 12:13:04,305 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 12:13:04,305 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 12:13:04,305 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 12:13:04,305 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 12:13:04,306 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 12:13:04,306 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 12:13:04,306 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 12:13:04,306 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 12:13:04,306 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 12:13:04,306 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 12:13:04,306 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 12:13:04,306 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 12:13:04,306 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 12:13:04,306 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 12:13:04,307 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 12:13:04,307 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 12:13:04,307 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 12:13:04,307 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 12:13:04,307 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 12:13:04,307 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 12:13:04,307 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 12:13:04,307 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 12:13:04,307 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 12:13:04,307 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 12:13:04,308 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 12:13:04,308 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 12:13:04,308 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 12:13:04,308 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 12:13:04,308 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 12:13:04,308 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 12:13:04,308 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 12:13:04,308 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 12:13:04,308 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 12:13:04,308 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 12:13:04,309 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 12:13:04,309 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 12:13:04,309 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 12:13:04,309 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 12:13:04,309 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 12:13:04,309 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 12:13:04,309 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 12:13:04,309 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 12:13:04,309 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 12:13:04,309 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 12:13:04,310 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 12:13:04,310 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 12:13:04,310 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 12:13:04,310 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 12:13:04,310 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 12:13:04,310 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 12:13:04,310 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 12:13:04,310 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 12:13:04,310 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 12:13:04,310 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 12:13:04,311 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 12:13:04,311 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 12:13:04,311 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 12:13:04,311 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 12:13:04,311 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 12:13:04,311 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 12:13:04,311 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 12:13:04,311 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 12:13:04,311 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 12:13:04,311 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 12:13:04,312 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 12:13:04,312 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 12:13:04,312 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 12:13:04,312 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 12:13:04,312 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 12:13:04,312 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 12:13:04,312 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 12:13:04,312 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 12:13:04,312 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 12:13:04,312 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 12:13:04,313 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 12:13:04,799 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 12:13:04,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:13:04 BoogieIcfgContainer [2018-04-11 12:13:04,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 12:13:04,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 12:13:04,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 12:13:04,803 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 12:13:04,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 12:13:03" (1/3) ... [2018-04-11 12:13:04,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db1e5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:13:04, skipping insertion in model container [2018-04-11 12:13:04,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 12:13:04" (2/3) ... [2018-04-11 12:13:04,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db1e5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 12:13:04, skipping insertion in model container [2018-04-11 12:13:04,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 12:13:04" (3/3) ... [2018-04-11 12:13:04,806 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-01_true-unreach-call_true-valid-memsafety.i [2018-04-11 12:13:04,815 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 12:13:04,822 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2018-04-11 12:13:04,856 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 12:13:04,857 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 12:13:04,857 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 12:13:04,857 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 12:13:04,857 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 12:13:04,857 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 12:13:04,857 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 12:13:04,857 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 12:13:04,858 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 12:13:04,858 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 12:13:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-04-11 12:13:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:13:04,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:04,879 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:04,879 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:04,882 INFO L82 PathProgramCache]: Analyzing trace with hash -383126915, now seen corresponding path program 1 times [2018-04-11 12:13:04,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:04,883 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:04,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:04,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:04,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:04,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:04,993 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:13:04,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:04,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:13:04,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:13:05,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:13:05,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:13:05,008 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-04-11 12:13:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:05,194 INFO L93 Difference]: Finished difference Result 226 states and 237 transitions. [2018-04-11 12:13:05,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:13:05,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:13:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:05,205 INFO L225 Difference]: With dead ends: 226 [2018-04-11 12:13:05,206 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 12:13:05,207 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:13:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 12:13:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 189. [2018-04-11 12:13:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 12:13:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 200 transitions. [2018-04-11 12:13:05,246 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 200 transitions. Word has length 8 [2018-04-11 12:13:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:05,246 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 200 transitions. [2018-04-11 12:13:05,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:13:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 200 transitions. [2018-04-11 12:13:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 12:13:05,247 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:05,247 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:05,247 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:05,247 INFO L82 PathProgramCache]: Analyzing trace with hash -383126914, now seen corresponding path program 1 times [2018-04-11 12:13:05,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:05,248 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:05,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:05,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:05,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:05,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:05,310 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:13:05,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:05,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:13:05,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:13:05,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:13:05,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:13:05,313 INFO L87 Difference]: Start difference. First operand 189 states and 200 transitions. Second operand 4 states. [2018-04-11 12:13:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:05,471 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2018-04-11 12:13:05,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:13:05,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 12:13:05,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:05,472 INFO L225 Difference]: With dead ends: 214 [2018-04-11 12:13:05,472 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 12:13:05,473 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:13:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 12:13:05,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 201. [2018-04-11 12:13:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-11 12:13:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 219 transitions. [2018-04-11 12:13:05,482 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 219 transitions. Word has length 8 [2018-04-11 12:13:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:05,482 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 219 transitions. [2018-04-11 12:13:05,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:13:05,482 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 219 transitions. [2018-04-11 12:13:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 12:13:05,483 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:05,483 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:13:05,483 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:05,483 INFO L82 PathProgramCache]: Analyzing trace with hash -627546445, now seen corresponding path program 1 times [2018-04-11 12:13:05,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:05,484 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:05,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:05,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:05,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:05,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:05,533 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:13:05,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:05,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:13:05,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:13:05,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:13:05,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:13:05,534 INFO L87 Difference]: Start difference. First operand 201 states and 219 transitions. Second operand 5 states. [2018-04-11 12:13:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:05,805 INFO L93 Difference]: Finished difference Result 343 states and 369 transitions. [2018-04-11 12:13:05,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:13:05,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 12:13:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:05,807 INFO L225 Difference]: With dead ends: 343 [2018-04-11 12:13:05,807 INFO L226 Difference]: Without dead ends: 343 [2018-04-11 12:13:05,807 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:13:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-11 12:13:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 200. [2018-04-11 12:13:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 12:13:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 218 transitions. [2018-04-11 12:13:05,817 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 218 transitions. Word has length 18 [2018-04-11 12:13:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:05,818 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 218 transitions. [2018-04-11 12:13:05,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:13:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 218 transitions. [2018-04-11 12:13:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 12:13:05,818 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:05,819 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:13:05,819 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:05,819 INFO L82 PathProgramCache]: Analyzing trace with hash -627546444, now seen corresponding path program 1 times [2018-04-11 12:13:05,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:05,819 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:05,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:05,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:05,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:05,834 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:05,883 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:13:05,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:05,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:13:05,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:13:05,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:13:05,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:13:05,884 INFO L87 Difference]: Start difference. First operand 200 states and 218 transitions. Second operand 5 states. [2018-04-11 12:13:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:06,104 INFO L93 Difference]: Finished difference Result 373 states and 408 transitions. [2018-04-11 12:13:06,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:13:06,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 12:13:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:06,106 INFO L225 Difference]: With dead ends: 373 [2018-04-11 12:13:06,106 INFO L226 Difference]: Without dead ends: 373 [2018-04-11 12:13:06,106 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:13:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-04-11 12:13:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 199. [2018-04-11 12:13:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-04-11 12:13:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 217 transitions. [2018-04-11 12:13:06,110 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 217 transitions. Word has length 18 [2018-04-11 12:13:06,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:06,110 INFO L459 AbstractCegarLoop]: Abstraction has 199 states and 217 transitions. [2018-04-11 12:13:06,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:13:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 217 transitions. [2018-04-11 12:13:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 12:13:06,111 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:06,111 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] [2018-04-11 12:13:06,111 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash 756513409, now seen corresponding path program 1 times [2018-04-11 12:13:06,111 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:06,111 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:06,112 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:06,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:06,112 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:06,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:06,201 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:13:06,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:06,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:13:06,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:13:06,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:13:06,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:13:06,202 INFO L87 Difference]: Start difference. First operand 199 states and 217 transitions. Second operand 8 states. [2018-04-11 12:13:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:06,618 INFO L93 Difference]: Finished difference Result 345 states and 370 transitions. [2018-04-11 12:13:06,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:13:06,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-04-11 12:13:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:06,620 INFO L225 Difference]: With dead ends: 345 [2018-04-11 12:13:06,620 INFO L226 Difference]: Without dead ends: 345 [2018-04-11 12:13:06,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 12:13:06,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-04-11 12:13:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 198. [2018-04-11 12:13:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-11 12:13:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 216 transitions. [2018-04-11 12:13:06,626 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 216 transitions. Word has length 21 [2018-04-11 12:13:06,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:06,627 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 216 transitions. [2018-04-11 12:13:06,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:13:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 216 transitions. [2018-04-11 12:13:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 12:13:06,627 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:06,628 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] [2018-04-11 12:13:06,628 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:06,628 INFO L82 PathProgramCache]: Analyzing trace with hash 756513410, now seen corresponding path program 1 times [2018-04-11 12:13:06,628 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:06,628 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:06,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:06,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:06,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:06,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:06,728 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:13:06,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:06,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:13:06,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:13:06,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:13:06,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:13:06,729 INFO L87 Difference]: Start difference. First operand 198 states and 216 transitions. Second operand 8 states. [2018-04-11 12:13:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:07,338 INFO L93 Difference]: Finished difference Result 346 states and 371 transitions. [2018-04-11 12:13:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:13:07,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-04-11 12:13:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:07,339 INFO L225 Difference]: With dead ends: 346 [2018-04-11 12:13:07,339 INFO L226 Difference]: Without dead ends: 346 [2018-04-11 12:13:07,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 12:13:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-11 12:13:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 197. [2018-04-11 12:13:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-11 12:13:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 215 transitions. [2018-04-11 12:13:07,343 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 215 transitions. Word has length 21 [2018-04-11 12:13:07,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:07,343 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 215 transitions. [2018-04-11 12:13:07,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:13:07,343 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 215 transitions. [2018-04-11 12:13:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 12:13:07,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:07,344 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:07,344 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:07,344 INFO L82 PathProgramCache]: Analyzing trace with hash 375229354, now seen corresponding path program 1 times [2018-04-11 12:13:07,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:07,344 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:07,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:07,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:07,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:07,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:07,394 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:13:07,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:07,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:13:07,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:13:07,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:13:07,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:13:07,395 INFO L87 Difference]: Start difference. First operand 197 states and 215 transitions. Second operand 5 states. [2018-04-11 12:13:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:07,470 INFO L93 Difference]: Finished difference Result 293 states and 316 transitions. [2018-04-11 12:13:07,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:13:07,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-04-11 12:13:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:07,471 INFO L225 Difference]: With dead ends: 293 [2018-04-11 12:13:07,471 INFO L226 Difference]: Without dead ends: 293 [2018-04-11 12:13:07,471 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:13:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-11 12:13:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 201. [2018-04-11 12:13:07,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-04-11 12:13:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 219 transitions. [2018-04-11 12:13:07,476 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 219 transitions. Word has length 27 [2018-04-11 12:13:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:07,476 INFO L459 AbstractCegarLoop]: Abstraction has 201 states and 219 transitions. [2018-04-11 12:13:07,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:13:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 219 transitions. [2018-04-11 12:13:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 12:13:07,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:07,477 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:07,478 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:07,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1824203793, now seen corresponding path program 1 times [2018-04-11 12:13:07,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:07,478 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:07,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:07,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:07,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:07,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:07,521 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:13:07,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:07,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 12:13:07,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 12:13:07,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 12:13:07,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 12:13:07,523 INFO L87 Difference]: Start difference. First operand 201 states and 219 transitions. Second operand 4 states. [2018-04-11 12:13:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:07,616 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2018-04-11 12:13:07,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 12:13:07,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-04-11 12:13:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:07,618 INFO L225 Difference]: With dead ends: 203 [2018-04-11 12:13:07,618 INFO L226 Difference]: Without dead ends: 203 [2018-04-11 12:13:07,618 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:13:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-11 12:13:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 192. [2018-04-11 12:13:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-04-11 12:13:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2018-04-11 12:13:07,622 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 29 [2018-04-11 12:13:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:07,623 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2018-04-11 12:13:07,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 12:13:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2018-04-11 12:13:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 12:13:07,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:07,624 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:07,624 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:07,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1824203792, now seen corresponding path program 1 times [2018-04-11 12:13:07,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:07,625 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:07,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:07,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:07,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:07,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:07,687 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:13:07,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:07,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:13:07,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:13:07,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:13:07,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:13:07,688 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand 5 states. [2018-04-11 12:13:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:07,854 INFO L93 Difference]: Finished difference Result 251 states and 265 transitions. [2018-04-11 12:13:07,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:13:07,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-11 12:13:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:07,855 INFO L225 Difference]: With dead ends: 251 [2018-04-11 12:13:07,855 INFO L226 Difference]: Without dead ends: 251 [2018-04-11 12:13:07,855 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:13:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-11 12:13:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 222. [2018-04-11 12:13:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-11 12:13:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 250 transitions. [2018-04-11 12:13:07,858 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 250 transitions. Word has length 29 [2018-04-11 12:13:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:07,858 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 250 transitions. [2018-04-11 12:13:07,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:13:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 250 transitions. [2018-04-11 12:13:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 12:13:07,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:07,858 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:07,858 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:07,859 INFO L82 PathProgramCache]: Analyzing trace with hash -713185966, now seen corresponding path program 1 times [2018-04-11 12:13:07,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:07,859 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:07,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:07,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:07,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:07,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:07,899 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:13:07,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:07,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:13:07,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:13:07,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:13:07,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:13:07,900 INFO L87 Difference]: Start difference. First operand 222 states and 250 transitions. Second operand 5 states. [2018-04-11 12:13:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:08,075 INFO L93 Difference]: Finished difference Result 314 states and 354 transitions. [2018-04-11 12:13:08,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:13:08,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-11 12:13:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:08,076 INFO L225 Difference]: With dead ends: 314 [2018-04-11 12:13:08,076 INFO L226 Difference]: Without dead ends: 314 [2018-04-11 12:13:08,077 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:13:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-11 12:13:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 221. [2018-04-11 12:13:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 12:13:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 248 transitions. [2018-04-11 12:13:08,079 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 248 transitions. Word has length 31 [2018-04-11 12:13:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:08,080 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 248 transitions. [2018-04-11 12:13:08,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:13:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 248 transitions. [2018-04-11 12:13:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 12:13:08,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:08,080 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:08,080 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:08,080 INFO L82 PathProgramCache]: Analyzing trace with hash -713185965, now seen corresponding path program 1 times [2018-04-11 12:13:08,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:08,080 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:08,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:08,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:08,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:08,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:08,140 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:13:08,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:08,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:13:08,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:13:08,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:13:08,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:13:08,141 INFO L87 Difference]: Start difference. First operand 221 states and 248 transitions. Second operand 5 states. [2018-04-11 12:13:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:08,322 INFO L93 Difference]: Finished difference Result 344 states and 390 transitions. [2018-04-11 12:13:08,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:13:08,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-11 12:13:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:08,323 INFO L225 Difference]: With dead ends: 344 [2018-04-11 12:13:08,323 INFO L226 Difference]: Without dead ends: 344 [2018-04-11 12:13:08,323 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:13:08,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-11 12:13:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 220. [2018-04-11 12:13:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 12:13:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 246 transitions. [2018-04-11 12:13:08,327 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 246 transitions. Word has length 31 [2018-04-11 12:13:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:08,327 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 246 transitions. [2018-04-11 12:13:08,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:13:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 246 transitions. [2018-04-11 12:13:08,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 12:13:08,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:08,328 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:08,328 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:08,328 INFO L82 PathProgramCache]: Analyzing trace with hash -389297068, now seen corresponding path program 1 times [2018-04-11 12:13:08,328 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:08,329 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:08,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:08,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:08,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:08,400 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:13:08,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:08,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 12:13:08,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 12:13:08,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 12:13:08,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 12:13:08,401 INFO L87 Difference]: Start difference. First operand 220 states and 246 transitions. Second operand 9 states. [2018-04-11 12:13:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:08,652 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2018-04-11 12:13:08,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:13:08,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-04-11 12:13:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:08,653 INFO L225 Difference]: With dead ends: 229 [2018-04-11 12:13:08,653 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 12:13:08,653 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:13:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 12:13:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2018-04-11 12:13:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 12:13:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 245 transitions. [2018-04-11 12:13:08,656 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 245 transitions. Word has length 35 [2018-04-11 12:13:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:08,656 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 245 transitions. [2018-04-11 12:13:08,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 12:13:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 245 transitions. [2018-04-11 12:13:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 12:13:08,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:08,656 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:08,657 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:08,657 INFO L82 PathProgramCache]: Analyzing trace with hash -389297067, now seen corresponding path program 1 times [2018-04-11 12:13:08,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:08,657 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:08,657 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:08,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:08,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:08,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:08,768 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:13:08,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:08,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 12:13:08,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 12:13:08,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 12:13:08,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:13:08,769 INFO L87 Difference]: Start difference. First operand 219 states and 245 transitions. Second operand 10 states. [2018-04-11 12:13:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:09,185 INFO L93 Difference]: Finished difference Result 221 states and 246 transitions. [2018-04-11 12:13:09,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 12:13:09,186 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-04-11 12:13:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:09,186 INFO L225 Difference]: With dead ends: 221 [2018-04-11 12:13:09,186 INFO L226 Difference]: Without dead ends: 221 [2018-04-11 12:13:09,187 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-04-11 12:13:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-11 12:13:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 200. [2018-04-11 12:13:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 12:13:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2018-04-11 12:13:09,190 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 35 [2018-04-11 12:13:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:09,190 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2018-04-11 12:13:09,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 12:13:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2018-04-11 12:13:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 12:13:09,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:09,192 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:09,192 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:09,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1622508317, now seen corresponding path program 1 times [2018-04-11 12:13:09,192 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:09,192 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:09,193 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:09,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:09,193 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:09,199 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:09,240 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:13:09,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:09,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:13:09,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:13:09,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:13:09,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:13:09,241 INFO L87 Difference]: Start difference. First operand 200 states and 225 transitions. Second operand 5 states. [2018-04-11 12:13:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:09,331 INFO L93 Difference]: Finished difference Result 226 states and 239 transitions. [2018-04-11 12:13:09,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 12:13:09,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-04-11 12:13:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:09,332 INFO L225 Difference]: With dead ends: 226 [2018-04-11 12:13:09,332 INFO L226 Difference]: Without dead ends: 226 [2018-04-11 12:13:09,333 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:13:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-04-11 12:13:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 200. [2018-04-11 12:13:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 12:13:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2018-04-11 12:13:09,337 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 37 [2018-04-11 12:13:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:09,337 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2018-04-11 12:13:09,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:13:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2018-04-11 12:13:09,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 12:13:09,338 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:09,338 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:09,338 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:09,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1211459762, now seen corresponding path program 1 times [2018-04-11 12:13:09,339 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:09,339 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:09,340 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:09,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:09,340 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:09,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:09,460 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:13:09,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:09,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 12:13:09,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 12:13:09,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 12:13:09,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:13:09,461 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand 10 states. [2018-04-11 12:13:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:09,759 INFO L93 Difference]: Finished difference Result 295 states and 318 transitions. [2018-04-11 12:13:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 12:13:09,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-11 12:13:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:09,760 INFO L225 Difference]: With dead ends: 295 [2018-04-11 12:13:09,760 INFO L226 Difference]: Without dead ends: 295 [2018-04-11 12:13:09,761 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2018-04-11 12:13:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-11 12:13:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 216. [2018-04-11 12:13:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-04-11 12:13:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 240 transitions. [2018-04-11 12:13:09,763 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 240 transitions. Word has length 43 [2018-04-11 12:13:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:09,763 INFO L459 AbstractCegarLoop]: Abstraction has 216 states and 240 transitions. [2018-04-11 12:13:09,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 12:13:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 240 transitions. [2018-04-11 12:13:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 12:13:09,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:09,764 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] [2018-04-11 12:13:09,764 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:09,764 INFO L82 PathProgramCache]: Analyzing trace with hash -392541986, now seen corresponding path program 1 times [2018-04-11 12:13:09,764 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:09,764 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:09,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:09,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:09,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:09,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:09,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:13:09,845 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:13:09,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:09,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:13:09,953 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:13:09,956 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:13:09,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:09,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:09,966 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:13:09,968 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:13:09,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:09,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:09,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:09,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-11 12:13:09,994 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 21 treesize of output 16 [2018-04-11 12:13:09,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:09,999 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:13:09,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,017 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 21 treesize of output 16 [2018-04-11 12:13:10,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,020 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:13:10,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2018-04-11 12:13:10,063 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 30 treesize of output 23 [2018-04-11 12:13:10,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 12:13:10,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,098 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 30 treesize of output 23 [2018-04-11 12:13:10,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 12:13:10,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-11 12:13:10,192 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 33 treesize of output 25 [2018-04-11 12:13:10,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,198 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-11 12:13:10,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,215 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 33 treesize of output 25 [2018-04-11 12:13:10,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:10,219 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-11 12:13:10,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:10,230 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:13:10,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:71, output treesize:7 [2018-04-11 12:13:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:10,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:13:10,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2018-04-11 12:13:10,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 12:13:10,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 12:13:10,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-04-11 12:13:10,286 INFO L87 Difference]: Start difference. First operand 216 states and 240 transitions. Second operand 12 states. [2018-04-11 12:13:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:10,832 INFO L93 Difference]: Finished difference Result 359 states and 384 transitions. [2018-04-11 12:13:10,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 12:13:10,832 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-04-11 12:13:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:10,833 INFO L225 Difference]: With dead ends: 359 [2018-04-11 12:13:10,833 INFO L226 Difference]: Without dead ends: 359 [2018-04-11 12:13:10,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2018-04-11 12:13:10,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-11 12:13:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 250. [2018-04-11 12:13:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-11 12:13:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 283 transitions. [2018-04-11 12:13:10,838 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 283 transitions. Word has length 45 [2018-04-11 12:13:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:10,838 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 283 transitions. [2018-04-11 12:13:10,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 12:13:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 283 transitions. [2018-04-11 12:13:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 12:13:10,838 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:10,839 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:10,839 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:10,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1698086673, now seen corresponding path program 1 times [2018-04-11 12:13:10,839 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:10,839 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:10,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:10,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:10,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:10,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:10,891 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:13:10,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:10,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:13:10,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:13:10,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:13:10,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:13:10,892 INFO L87 Difference]: Start difference. First operand 250 states and 283 transitions. Second operand 5 states. [2018-04-11 12:13:11,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:11,071 INFO L93 Difference]: Finished difference Result 368 states and 416 transitions. [2018-04-11 12:13:11,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:13:11,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-04-11 12:13:11,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:11,073 INFO L225 Difference]: With dead ends: 368 [2018-04-11 12:13:11,073 INFO L226 Difference]: Without dead ends: 368 [2018-04-11 12:13:11,073 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:13:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-11 12:13:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 249. [2018-04-11 12:13:11,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-04-11 12:13:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 282 transitions. [2018-04-11 12:13:11,078 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 282 transitions. Word has length 47 [2018-04-11 12:13:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:11,078 INFO L459 AbstractCegarLoop]: Abstraction has 249 states and 282 transitions. [2018-04-11 12:13:11,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:13:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 282 transitions. [2018-04-11 12:13:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 12:13:11,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:11,079 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:11,079 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:11,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1698086674, now seen corresponding path program 1 times [2018-04-11 12:13:11,079 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:11,080 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:11,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:11,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:11,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:11,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:11,129 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:13:11,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:11,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 12:13:11,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:13:11,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:13:11,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:13:11,130 INFO L87 Difference]: Start difference. First operand 249 states and 282 transitions. Second operand 5 states. [2018-04-11 12:13:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:11,343 INFO L93 Difference]: Finished difference Result 401 states and 455 transitions. [2018-04-11 12:13:11,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:13:11,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-04-11 12:13:11,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:11,344 INFO L225 Difference]: With dead ends: 401 [2018-04-11 12:13:11,345 INFO L226 Difference]: Without dead ends: 401 [2018-04-11 12:13:11,345 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:13:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-04-11 12:13:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 248. [2018-04-11 12:13:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-11 12:13:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 281 transitions. [2018-04-11 12:13:11,349 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 281 transitions. Word has length 47 [2018-04-11 12:13:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:11,349 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 281 transitions. [2018-04-11 12:13:11,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:13:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 281 transitions. [2018-04-11 12:13:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 12:13:11,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:11,350 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:11,350 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:11,350 INFO L82 PathProgramCache]: Analyzing trace with hash 234398632, now seen corresponding path program 1 times [2018-04-11 12:13:11,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:11,351 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:11,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:11,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:11,352 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:11,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:11,466 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:13:11,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:11,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 12:13:11,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 12:13:11,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 12:13:11,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:13:11,467 INFO L87 Difference]: Start difference. First operand 248 states and 281 transitions. Second operand 11 states. [2018-04-11 12:13:11,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:11,941 INFO L93 Difference]: Finished difference Result 486 states and 529 transitions. [2018-04-11 12:13:11,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 12:13:11,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-04-11 12:13:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:11,942 INFO L225 Difference]: With dead ends: 486 [2018-04-11 12:13:11,942 INFO L226 Difference]: Without dead ends: 486 [2018-04-11 12:13:11,942 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2018-04-11 12:13:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-04-11 12:13:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 254. [2018-04-11 12:13:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-11 12:13:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 286 transitions. [2018-04-11 12:13:11,945 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 286 transitions. Word has length 48 [2018-04-11 12:13:11,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:11,945 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 286 transitions. [2018-04-11 12:13:11,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 12:13:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 286 transitions. [2018-04-11 12:13:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 12:13:11,946 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:11,946 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:11,946 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:11,946 INFO L82 PathProgramCache]: Analyzing trace with hash 234398633, now seen corresponding path program 1 times [2018-04-11 12:13:11,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:11,946 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:11,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:11,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:11,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:11,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:12,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:12,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 12:13:12,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 12:13:12,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 12:13:12,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-04-11 12:13:12,150 INFO L87 Difference]: Start difference. First operand 254 states and 286 transitions. Second operand 14 states. [2018-04-11 12:13:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:13,001 INFO L93 Difference]: Finished difference Result 545 states and 584 transitions. [2018-04-11 12:13:13,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 12:13:13,001 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-04-11 12:13:13,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:13,002 INFO L225 Difference]: With dead ends: 545 [2018-04-11 12:13:13,002 INFO L226 Difference]: Without dead ends: 545 [2018-04-11 12:13:13,002 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 12:13:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-04-11 12:13:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 261. [2018-04-11 12:13:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-11 12:13:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 292 transitions. [2018-04-11 12:13:13,011 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 292 transitions. Word has length 48 [2018-04-11 12:13:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:13,011 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 292 transitions. [2018-04-11 12:13:13,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 12:13:13,011 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 292 transitions. [2018-04-11 12:13:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 12:13:13,011 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:13,011 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:13,011 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:13,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1575403103, now seen corresponding path program 1 times [2018-04-11 12:13:13,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:13,012 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:13,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:13,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:13,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:13,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:13,091 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:13:13,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:13,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:13:13,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:13:13,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:13:13,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:13:13,093 INFO L87 Difference]: Start difference. First operand 261 states and 292 transitions. Second operand 8 states. [2018-04-11 12:13:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:13,360 INFO L93 Difference]: Finished difference Result 281 states and 314 transitions. [2018-04-11 12:13:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:13:13,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-11 12:13:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:13,361 INFO L225 Difference]: With dead ends: 281 [2018-04-11 12:13:13,361 INFO L226 Difference]: Without dead ends: 281 [2018-04-11 12:13:13,361 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 12:13:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-11 12:13:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2018-04-11 12:13:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-11 12:13:13,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 291 transitions. [2018-04-11 12:13:13,364 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 291 transitions. Word has length 50 [2018-04-11 12:13:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:13,364 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 291 transitions. [2018-04-11 12:13:13,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:13:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 291 transitions. [2018-04-11 12:13:13,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 12:13:13,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:13,365 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:13,365 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:13,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1575403104, now seen corresponding path program 1 times [2018-04-11 12:13:13,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:13,365 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:13,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:13,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:13,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:13,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:13,460 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:13:13,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:13,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:13:13,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:13:13,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:13:13,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 12:13:13,461 INFO L87 Difference]: Start difference. First operand 260 states and 291 transitions. Second operand 8 states. [2018-04-11 12:13:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:13,717 INFO L93 Difference]: Finished difference Result 280 states and 313 transitions. [2018-04-11 12:13:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 12:13:13,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-11 12:13:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:13,718 INFO L225 Difference]: With dead ends: 280 [2018-04-11 12:13:13,719 INFO L226 Difference]: Without dead ends: 280 [2018-04-11 12:13:13,719 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 12:13:13,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-04-11 12:13:13,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 259. [2018-04-11 12:13:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-04-11 12:13:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2018-04-11 12:13:13,723 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 50 [2018-04-11 12:13:13,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:13,723 INFO L459 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2018-04-11 12:13:13,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:13:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2018-04-11 12:13:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 12:13:13,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:13,724 INFO L355 BasicCegarLoop]: trace histogram [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:13:13,724 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:13,724 INFO L82 PathProgramCache]: Analyzing trace with hash -746323642, now seen corresponding path program 1 times [2018-04-11 12:13:13,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:13,724 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:13,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:13,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:13,725 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:13,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:13:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:13:13,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:13,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:13:13,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 12:13:13,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 12:13:13,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:13:13,794 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand 7 states. [2018-04-11 12:13:13,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:13,901 INFO L93 Difference]: Finished difference Result 286 states and 317 transitions. [2018-04-11 12:13:13,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:13:13,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-04-11 12:13:13,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:13,902 INFO L225 Difference]: With dead ends: 286 [2018-04-11 12:13:13,902 INFO L226 Difference]: Without dead ends: 286 [2018-04-11 12:13:13,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:13:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-04-11 12:13:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 271. [2018-04-11 12:13:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-04-11 12:13:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 302 transitions. [2018-04-11 12:13:13,905 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 302 transitions. Word has length 54 [2018-04-11 12:13:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:13,905 INFO L459 AbstractCegarLoop]: Abstraction has 271 states and 302 transitions. [2018-04-11 12:13:13,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 12:13:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 302 transitions. [2018-04-11 12:13:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 12:13:13,905 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:13,905 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:13,905 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:13,906 INFO L82 PathProgramCache]: Analyzing trace with hash -871381849, now seen corresponding path program 1 times [2018-04-11 12:13:13,906 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:13,906 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:13,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:13,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:13,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:13,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:13,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:13:13,962 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:13:13,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:13,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:13:14,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:13:14,008 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 10 treesize of output 9 [2018-04-11 12:13:14,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:14,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:14,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:14,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-11 12:13:14,103 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 15 treesize of output 11 [2018-04-11 12:13:14,108 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 11 treesize of output 8 [2018-04-11 12:13:14,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:13:14,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:13:14,120 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 24 treesize of output 18 [2018-04-11 12:13:14,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:14,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:14,148 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-04-11 12:13:14,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:13:14,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:13:14,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:13:14,170 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-04-11 12:13:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:14,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:13:14,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-04-11 12:13:14,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 12:13:14,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 12:13:14,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-04-11 12:13:14,280 INFO L87 Difference]: Start difference. First operand 271 states and 302 transitions. Second operand 17 states. [2018-04-11 12:13:14,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:15,026 INFO L93 Difference]: Finished difference Result 408 states and 431 transitions. [2018-04-11 12:13:15,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 12:13:15,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2018-04-11 12:13:15,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:15,027 INFO L225 Difference]: With dead ends: 408 [2018-04-11 12:13:15,027 INFO L226 Difference]: Without dead ends: 408 [2018-04-11 12:13:15,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=976, Unknown=2, NotChecked=0, Total=1190 [2018-04-11 12:13:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-04-11 12:13:15,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 302. [2018-04-11 12:13:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-11 12:13:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 340 transitions. [2018-04-11 12:13:15,030 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 340 transitions. Word has length 58 [2018-04-11 12:13:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:15,031 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 340 transitions. [2018-04-11 12:13:15,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 12:13:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 340 transitions. [2018-04-11 12:13:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 12:13:15,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:15,031 INFO L355 BasicCegarLoop]: trace histogram [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:13:15,031 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:15,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2093652140, now seen corresponding path program 1 times [2018-04-11 12:13:15,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:15,032 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:15,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:15,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:15,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:15,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:13:15,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:15,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 12:13:15,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 12:13:15,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 12:13:15,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-04-11 12:13:15,212 INFO L87 Difference]: Start difference. First operand 302 states and 340 transitions. Second operand 16 states. [2018-04-11 12:13:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:16,146 INFO L93 Difference]: Finished difference Result 565 states and 616 transitions. [2018-04-11 12:13:16,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 12:13:16,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-04-11 12:13:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:16,149 INFO L225 Difference]: With dead ends: 565 [2018-04-11 12:13:16,150 INFO L226 Difference]: Without dead ends: 565 [2018-04-11 12:13:16,150 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=1316, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 12:13:16,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-04-11 12:13:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 312. [2018-04-11 12:13:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-04-11 12:13:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 352 transitions. [2018-04-11 12:13:16,158 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 352 transitions. Word has length 59 [2018-04-11 12:13:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:16,158 INFO L459 AbstractCegarLoop]: Abstraction has 312 states and 352 transitions. [2018-04-11 12:13:16,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 12:13:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 352 transitions. [2018-04-11 12:13:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 12:13:16,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:16,159 INFO L355 BasicCegarLoop]: trace histogram [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:13:16,159 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2093652141, now seen corresponding path program 1 times [2018-04-11 12:13:16,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:16,160 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:16,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:16,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:16,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:16,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:13:16,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:16,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-04-11 12:13:16,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 12:13:16,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 12:13:16,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-04-11 12:13:16,478 INFO L87 Difference]: Start difference. First operand 312 states and 352 transitions. Second operand 17 states. [2018-04-11 12:13:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:17,392 INFO L93 Difference]: Finished difference Result 558 states and 609 transitions. [2018-04-11 12:13:17,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 12:13:17,393 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-04-11 12:13:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:17,394 INFO L225 Difference]: With dead ends: 558 [2018-04-11 12:13:17,394 INFO L226 Difference]: Without dead ends: 558 [2018-04-11 12:13:17,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=368, Invalid=1114, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 12:13:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-04-11 12:13:17,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 319. [2018-04-11 12:13:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-04-11 12:13:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 358 transitions. [2018-04-11 12:13:17,398 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 358 transitions. Word has length 59 [2018-04-11 12:13:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:17,398 INFO L459 AbstractCegarLoop]: Abstraction has 319 states and 358 transitions. [2018-04-11 12:13:17,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 12:13:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 358 transitions. [2018-04-11 12:13:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 12:13:17,399 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:17,399 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, 1, 1, 1] [2018-04-11 12:13:17,399 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1243032287, now seen corresponding path program 1 times [2018-04-11 12:13:17,399 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:17,399 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:17,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:17,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:17,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:13:17,462 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:13:17,462 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:13:17,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:17,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:13:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:13:17,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:13:17,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-04-11 12:13:17,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 12:13:17,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 12:13:17,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=36, Unknown=4, NotChecked=0, Total=56 [2018-04-11 12:13:17,570 INFO L87 Difference]: Start difference. First operand 319 states and 358 transitions. Second operand 8 states. [2018-04-11 12:13:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:17,735 INFO L93 Difference]: Finished difference Result 360 states and 399 transitions. [2018-04-11 12:13:17,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 12:13:17,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-04-11 12:13:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:17,736 INFO L225 Difference]: With dead ends: 360 [2018-04-11 12:13:17,737 INFO L226 Difference]: Without dead ends: 328 [2018-04-11 12:13:17,737 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=72, Unknown=4, NotChecked=0, Total=110 [2018-04-11 12:13:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-04-11 12:13:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2018-04-11 12:13:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-04-11 12:13:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 366 transitions. [2018-04-11 12:13:17,741 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 366 transitions. Word has length 59 [2018-04-11 12:13:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:17,741 INFO L459 AbstractCegarLoop]: Abstraction has 327 states and 366 transitions. [2018-04-11 12:13:17,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 12:13:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 366 transitions. [2018-04-11 12:13:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 12:13:17,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:17,742 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:17,742 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:17,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1110895995, now seen corresponding path program 1 times [2018-04-11 12:13:17,742 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:17,742 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:17,743 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:17,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:17,743 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:17,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:13:17,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:17,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 12:13:17,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 12:13:17,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 12:13:17,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:13:17,848 INFO L87 Difference]: Start difference. First operand 327 states and 366 transitions. Second operand 7 states. [2018-04-11 12:13:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:18,054 INFO L93 Difference]: Finished difference Result 351 states and 385 transitions. [2018-04-11 12:13:18,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 12:13:18,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-04-11 12:13:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:18,055 INFO L225 Difference]: With dead ends: 351 [2018-04-11 12:13:18,055 INFO L226 Difference]: Without dead ends: 351 [2018-04-11 12:13:18,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 12:13:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-04-11 12:13:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 327. [2018-04-11 12:13:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-04-11 12:13:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 365 transitions. [2018-04-11 12:13:18,061 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 365 transitions. Word has length 64 [2018-04-11 12:13:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:18,061 INFO L459 AbstractCegarLoop]: Abstraction has 327 states and 365 transitions. [2018-04-11 12:13:18,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 12:13:18,061 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 365 transitions. [2018-04-11 12:13:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 12:13:18,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:18,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:18,062 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:18,062 INFO L82 PathProgramCache]: Analyzing trace with hash 277588261, now seen corresponding path program 1 times [2018-04-11 12:13:18,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:18,062 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:18,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:18,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:18,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:18,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:18,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:18,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 12:13:18,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 12:13:18,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 12:13:18,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 12:13:18,120 INFO L87 Difference]: Start difference. First operand 327 states and 365 transitions. Second operand 6 states. [2018-04-11 12:13:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:18,201 INFO L93 Difference]: Finished difference Result 318 states and 350 transitions. [2018-04-11 12:13:18,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:13:18,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-04-11 12:13:18,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:18,202 INFO L225 Difference]: With dead ends: 318 [2018-04-11 12:13:18,202 INFO L226 Difference]: Without dead ends: 318 [2018-04-11 12:13:18,202 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-04-11 12:13:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-04-11 12:13:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-04-11 12:13:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-04-11 12:13:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 350 transitions. [2018-04-11 12:13:18,206 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 350 transitions. Word has length 64 [2018-04-11 12:13:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:18,207 INFO L459 AbstractCegarLoop]: Abstraction has 318 states and 350 transitions. [2018-04-11 12:13:18,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 12:13:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 350 transitions. [2018-04-11 12:13:18,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 12:13:18,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:18,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:18,208 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:18,208 INFO L82 PathProgramCache]: Analyzing trace with hash -572572864, now seen corresponding path program 1 times [2018-04-11 12:13:18,208 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:18,208 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:18,209 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:18,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:18,209 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:18,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 12:13:18,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:18,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 12:13:18,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 12:13:18,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 12:13:18,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-04-11 12:13:18,314 INFO L87 Difference]: Start difference. First operand 318 states and 350 transitions. Second operand 10 states. [2018-04-11 12:13:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:18,629 INFO L93 Difference]: Finished difference Result 454 states and 504 transitions. [2018-04-11 12:13:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 12:13:18,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-04-11 12:13:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:18,631 INFO L225 Difference]: With dead ends: 454 [2018-04-11 12:13:18,631 INFO L226 Difference]: Without dead ends: 454 [2018-04-11 12:13:18,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-04-11 12:13:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-04-11 12:13:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 288. [2018-04-11 12:13:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-04-11 12:13:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 318 transitions. [2018-04-11 12:13:18,636 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 318 transitions. Word has length 66 [2018-04-11 12:13:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:18,636 INFO L459 AbstractCegarLoop]: Abstraction has 288 states and 318 transitions. [2018-04-11 12:13:18,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 12:13:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 318 transitions. [2018-04-11 12:13:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 12:13:18,637 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:18,637 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:18,637 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:18,637 INFO L82 PathProgramCache]: Analyzing trace with hash -167614952, now seen corresponding path program 1 times [2018-04-11 12:13:18,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:18,637 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:18,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:18,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:18,638 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:18,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:13:18,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:18,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 12:13:18,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 12:13:18,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 12:13:18,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-04-11 12:13:18,751 INFO L87 Difference]: Start difference. First operand 288 states and 318 transitions. Second operand 9 states. [2018-04-11 12:13:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:19,105 INFO L93 Difference]: Finished difference Result 455 states and 505 transitions. [2018-04-11 12:13:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 12:13:19,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 69 [2018-04-11 12:13:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:19,107 INFO L225 Difference]: With dead ends: 455 [2018-04-11 12:13:19,107 INFO L226 Difference]: Without dead ends: 455 [2018-04-11 12:13:19,107 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-04-11 12:13:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-04-11 12:13:19,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 291. [2018-04-11 12:13:19,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-04-11 12:13:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 321 transitions. [2018-04-11 12:13:19,111 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 321 transitions. Word has length 69 [2018-04-11 12:13:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:19,111 INFO L459 AbstractCegarLoop]: Abstraction has 291 states and 321 transitions. [2018-04-11 12:13:19,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 12:13:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 321 transitions. [2018-04-11 12:13:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 12:13:19,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:19,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:19,112 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash 309824900, now seen corresponding path program 1 times [2018-04-11 12:13:19,112 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:19,113 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:19,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:19,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:19,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:19,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 12:13:19,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 12:13:19,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 12:13:19,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 12:13:19,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 12:13:19,177 INFO L87 Difference]: Start difference. First operand 291 states and 321 transitions. Second operand 5 states. [2018-04-11 12:13:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:19,268 INFO L93 Difference]: Finished difference Result 307 states and 338 transitions. [2018-04-11 12:13:19,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 12:13:19,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-04-11 12:13:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:19,269 INFO L225 Difference]: With dead ends: 307 [2018-04-11 12:13:19,270 INFO L226 Difference]: Without dead ends: 307 [2018-04-11 12:13:19,270 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:13:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-11 12:13:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 295. [2018-04-11 12:13:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-11 12:13:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 325 transitions. [2018-04-11 12:13:19,274 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 325 transitions. Word has length 69 [2018-04-11 12:13:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:19,274 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 325 transitions. [2018-04-11 12:13:19,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 12:13:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 325 transitions. [2018-04-11 12:13:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-11 12:13:19,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:19,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:19,277 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2136016223, now seen corresponding path program 1 times [2018-04-11 12:13:19,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:19,277 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:19,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:19,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:19,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:19,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:19,721 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:13:19,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:13:19,721 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:13:19,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:19,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:13:19,785 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 13 treesize of output 10 [2018-04-11 12:13:19,787 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 10 treesize of output 9 [2018-04-11 12:13:19,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,796 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 13 treesize of output 10 [2018-04-11 12:13:19,798 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 10 treesize of output 9 [2018-04-11 12:13:19,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-11 12:13:19,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:19,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:19,845 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:13:19,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:35 [2018-04-11 12:13:19,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-11 12:13:19,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:19,884 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:13:19,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,898 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 21 treesize of output 19 [2018-04-11 12:13:19,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:19,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 16 treesize of output 23 [2018-04-11 12:13:19,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,911 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:13:19,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:39 [2018-04-11 12:13:19,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:19,960 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 31 treesize of output 32 [2018-04-11 12:13:19,961 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:13:19,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:19,976 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:13:19,978 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:13:19,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:19,991 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:13:19,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2018-04-11 12:13:20,104 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:13:20,112 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:13:20,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:13:20,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:13:20,160 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:13:20,162 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 70 treesize of output 74 [2018-04-11 12:13:20,168 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 22 [2018-04-11 12:13:20,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,183 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 74 treesize of output 79 [2018-04-11 12:13:20,186 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:13:20,186 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:13:20,186 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,197 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,219 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:13:20,219 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:145 [2018-04-11 12:13:20,278 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:13:20,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:20,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 12:13:20,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-04-11 12:13:20,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:20,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 12:13:20,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,336 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:13:20,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:81 [2018-04-11 12:13:20,429 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 75 treesize of output 58 [2018-04-11 12:13:20,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:20,432 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 41 treesize of output 30 [2018-04-11 12:13:20,432 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:13:20,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:20,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:13:20,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,445 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:13:20,453 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 35 treesize of output 31 [2018-04-11 12:13:20,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 12:13:20,455 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:20,460 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:13:20,460 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,462 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:20,465 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:99, output treesize:7 [2018-04-11 12:13:20,502 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:13:20,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:13:20,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 33 [2018-04-11 12:13:20,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 12:13:20,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 12:13:20,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=910, Unknown=1, NotChecked=0, Total=1056 [2018-04-11 12:13:20,521 INFO L87 Difference]: Start difference. First operand 295 states and 325 transitions. Second operand 33 states. [2018-04-11 12:13:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:22,501 INFO L93 Difference]: Finished difference Result 614 states and 666 transitions. [2018-04-11 12:13:22,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 12:13:22,501 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 71 [2018-04-11 12:13:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:22,502 INFO L225 Difference]: With dead ends: 614 [2018-04-11 12:13:22,503 INFO L226 Difference]: Without dead ends: 614 [2018-04-11 12:13:22,503 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=912, Invalid=3915, Unknown=3, NotChecked=0, Total=4830 [2018-04-11 12:13:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-04-11 12:13:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 343. [2018-04-11 12:13:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-11 12:13:22,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 376 transitions. [2018-04-11 12:13:22,507 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 376 transitions. Word has length 71 [2018-04-11 12:13:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:22,507 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 376 transitions. [2018-04-11 12:13:22,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 12:13:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 376 transitions. [2018-04-11 12:13:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 12:13:22,508 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:22,508 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:22,508 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:22,508 INFO L82 PathProgramCache]: Analyzing trace with hash -398625105, now seen corresponding path program 1 times [2018-04-11 12:13:22,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:22,508 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:22,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:22,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:22,509 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:22,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:22,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:13:22,812 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:13:22,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:22,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:13:22,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-11 12:13:22,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 12:13:22,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:22,980 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 17 treesize of output 22 [2018-04-11 12:13:22,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 12:13:22,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:13:23,009 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:13:23,011 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:13:23,011 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:13:23,027 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:49, output treesize:82 [2018-04-11 12:13:23,105 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 52 treesize of output 47 [2018-04-11 12:13:23,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,108 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:13:23,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,149 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 48 treesize of output 43 [2018-04-11 12:13:23,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,153 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:13:23,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 85 [2018-04-11 12:13:23,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,208 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 83 treesize of output 94 [2018-04-11 12:13:23,208 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,241 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 67 [2018-04-11 12:13:23,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 12:13:23,268 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,287 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 12:13:23,305 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:141, output treesize:117 [2018-04-11 12:13:23,425 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 58 treesize of output 52 [2018-04-11 12:13:23,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 12:13:23,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,474 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 38 treesize of output 32 [2018-04-11 12:13:23,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 12:13:23,481 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 74 [2018-04-11 12:13:23,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,522 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 70 treesize of output 64 [2018-04-11 12:13:23,522 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,552 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 63 [2018-04-11 12:13:23,552 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 12:13:23,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 47 [2018-04-11 12:13:23,590 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,621 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 12:13:23,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-04-11 12:13:23,667 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 44 treesize of output 39 [2018-04-11 12:13:23,667 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,690 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 39 treesize of output 33 [2018-04-11 12:13:23,691 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,718 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2018-04-11 12:13:23,718 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-11 12:13:23,743 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 12:13:23,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 12:13:23,747 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:13:23,747 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,754 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:13:23,754 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,759 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2018-04-11 12:13:23,766 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 45 treesize of output 40 [2018-04-11 12:13:23,766 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:23,790 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-04-11 12:13:23,790 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,807 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:23,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 12:13:23,835 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 9 variables, input treesize:145, output treesize:56 [2018-04-11 12:13:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:23,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:13:23,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-04-11 12:13:23,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 12:13:23,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 12:13:23,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-04-11 12:13:23,917 INFO L87 Difference]: Start difference. First operand 343 states and 376 transitions. Second operand 26 states. [2018-04-11 12:13:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:25,614 INFO L93 Difference]: Finished difference Result 683 states and 736 transitions. [2018-04-11 12:13:25,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 12:13:25,614 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-04-11 12:13:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:25,615 INFO L225 Difference]: With dead ends: 683 [2018-04-11 12:13:25,615 INFO L226 Difference]: Without dead ends: 683 [2018-04-11 12:13:25,616 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=668, Invalid=2300, Unknown=2, NotChecked=0, Total=2970 [2018-04-11 12:13:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-04-11 12:13:25,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 417. [2018-04-11 12:13:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-04-11 12:13:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 461 transitions. [2018-04-11 12:13:25,620 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 461 transitions. Word has length 73 [2018-04-11 12:13:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:25,621 INFO L459 AbstractCegarLoop]: Abstraction has 417 states and 461 transitions. [2018-04-11 12:13:25,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 12:13:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 461 transitions. [2018-04-11 12:13:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 12:13:25,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:25,621 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:25,621 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:25,621 INFO L82 PathProgramCache]: Analyzing trace with hash -398625104, now seen corresponding path program 1 times [2018-04-11 12:13:25,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:25,621 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:25,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:25,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:25,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:25,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:25,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:13:25,896 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:13:25,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:25,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:13:25,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:13:25,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:25,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:25,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 12:13:25,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:25,978 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:13:25,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:25,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:25,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:25,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:13:25,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:25,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:25,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-04-11 12:13:26,014 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:13:26,015 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:13:26,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,026 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:13:26,027 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:13:26,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,037 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:13:26,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-11 12:13:26,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:26,081 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:13:26,083 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:13:26,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:26,112 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:13:26,123 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:13:26,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,142 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:13:26,142 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2018-04-11 12:13:26,250 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:13:26,258 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:13:26,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:13:26,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:13:26,307 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:13:26,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 83 treesize of output 87 [2018-04-11 12:13:26,318 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:13:26,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-11 12:13:26,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,352 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 83 treesize of output 100 [2018-04-11 12:13:26,356 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:13:26,356 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 38 [2018-04-11 12:13:26,357 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,376 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,402 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:13:26,403 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:101, output treesize:199 [2018-04-11 12:13:26,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 103 [2018-04-11 12:13:26,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-04-11 12:13:26,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,489 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 80 treesize of output 75 [2018-04-11 12:13:26,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:26,491 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 28 treesize of output 47 [2018-04-11 12:13:26,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,511 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:140, output treesize:100 [2018-04-11 12:13:26,572 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 89 treesize of output 67 [2018-04-11 12:13:26,573 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 47 treesize of output 34 [2018-04-11 12:13:26,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:26,582 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 21 treesize of output 22 [2018-04-11 12:13:26,582 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,596 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 39 treesize of output 31 [2018-04-11 12:13:26,597 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 27 treesize of output 16 [2018-04-11 12:13:26,598 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:26,602 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 10 [2018-04-11 12:13:26,603 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,605 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:26,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:13:26,610 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:18 [2018-04-11 12:13:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:13:26,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:13:26,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 29 [2018-04-11 12:13:26,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 12:13:26,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 12:13:26,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2018-04-11 12:13:26,743 INFO L87 Difference]: Start difference. First operand 417 states and 461 transitions. Second operand 30 states. [2018-04-11 12:13:29,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:29,226 INFO L93 Difference]: Finished difference Result 831 states and 896 transitions. [2018-04-11 12:13:29,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 12:13:29,226 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 73 [2018-04-11 12:13:29,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:29,228 INFO L225 Difference]: With dead ends: 831 [2018-04-11 12:13:29,228 INFO L226 Difference]: Without dead ends: 831 [2018-04-11 12:13:29,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1050, Invalid=3642, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 12:13:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-04-11 12:13:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 516. [2018-04-11 12:13:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-04-11 12:13:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 577 transitions. [2018-04-11 12:13:29,235 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 577 transitions. Word has length 73 [2018-04-11 12:13:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:29,235 INFO L459 AbstractCegarLoop]: Abstraction has 516 states and 577 transitions. [2018-04-11 12:13:29,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 12:13:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 577 transitions. [2018-04-11 12:13:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-11 12:13:29,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:29,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:29,236 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:29,236 INFO L82 PathProgramCache]: Analyzing trace with hash 692807353, now seen corresponding path program 1 times [2018-04-11 12:13:29,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:29,237 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:29,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:29,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:29,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:29,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:29,635 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:13:29,635 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:13:29,635 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:13:29,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:29,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:13:29,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:29,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:29,683 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:13:29,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:29,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:29,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 12:13:29,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:13:29,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 12:13:29,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:29,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:29,711 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:13:29,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 12:13:29,736 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 45 treesize of output 39 [2018-04-11 12:13:29,737 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:13:29,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:29,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:29,747 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:13:29,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-11 12:13:29,799 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 46 [2018-04-11 12:13:29,801 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 29 [2018-04-11 12:13:29,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:29,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:29,811 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:13:29,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-11 12:13:33,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:33,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:33,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:33,874 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 28 treesize of output 58 [2018-04-11 12:13:33,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:33,883 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:13:33,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-11 12:13:33,920 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 61 [2018-04-11 12:13:33,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:33,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-11 12:13:33,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:33,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:33,939 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:13:33,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-11 12:13:34,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:34,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:34,016 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 120 [2018-04-11 12:13:34,022 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:13:34,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:34,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:34,042 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:13:34,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:95 [2018-04-11 12:13:34,217 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 99 treesize of output 107 [2018-04-11 12:13:34,227 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:13:34,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:13:34,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:13:34,300 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:13:34,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:182 [2018-04-11 12:13:34,408 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 100 treesize of output 93 [2018-04-11 12:13:34,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:34,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 12:13:34,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:34,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:34,443 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:13:34,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:100 [2018-04-11 12:13:34,598 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 91 treesize of output 64 [2018-04-11 12:13:34,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 23 [2018-04-11 12:13:34,602 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:13:34,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:34,617 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:13:34,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:34,627 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:13:34,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:34,633 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:13:34,641 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:13:34,641 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:28 [2018-04-11 12:13:34,784 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:13:34,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:13:34,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 38 [2018-04-11 12:13:34,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 12:13:34,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 12:13:34,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1239, Unknown=4, NotChecked=0, Total=1482 [2018-04-11 12:13:34,803 INFO L87 Difference]: Start difference. First operand 516 states and 577 transitions. Second operand 39 states. [2018-04-11 12:13:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:13:52,803 INFO L93 Difference]: Finished difference Result 990 states and 1102 transitions. [2018-04-11 12:13:52,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 12:13:52,821 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-04-11 12:13:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:13:52,822 INFO L225 Difference]: With dead ends: 990 [2018-04-11 12:13:52,822 INFO L226 Difference]: Without dead ends: 990 [2018-04-11 12:13:52,823 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=1079, Invalid=4308, Unknown=15, NotChecked=0, Total=5402 [2018-04-11 12:13:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2018-04-11 12:13:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 532. [2018-04-11 12:13:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-04-11 12:13:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 596 transitions. [2018-04-11 12:13:52,827 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 596 transitions. Word has length 76 [2018-04-11 12:13:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:13:52,827 INFO L459 AbstractCegarLoop]: Abstraction has 532 states and 596 transitions. [2018-04-11 12:13:52,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 12:13:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 596 transitions. [2018-04-11 12:13:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-11 12:13:52,828 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:13:52,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:13:52,828 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:13:52,828 INFO L82 PathProgramCache]: Analyzing trace with hash 692807354, now seen corresponding path program 1 times [2018-04-11 12:13:52,828 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:13:52,828 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:13:52,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:52,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:52,829 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:13:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:52,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:13:53,444 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:13:53,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:13:53,444 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:13:53,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:13:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:13:53,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:13:53,504 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:13:53,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:53,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:53,513 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:13:53,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 12:13:53,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:13:53,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 12:13:53,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,554 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 13 treesize of output 10 [2018-04-11 12:13:53,555 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 10 treesize of output 9 [2018-04-11 12:13:53,555 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,565 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:13:53,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:53 [2018-04-11 12:13:53,624 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 33 treesize of output 34 [2018-04-11 12:13:53,626 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:13:53,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,641 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 69 treesize of output 63 [2018-04-11 12:13:53,642 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:13:53,642 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,654 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:13:53,654 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:79 [2018-04-11 12:13:53,720 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 109 treesize of output 95 [2018-04-11 12:13:53,722 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 29 [2018-04-11 12:13:53,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,744 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 48 treesize of output 41 [2018-04-11 12:13:53,746 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 29 [2018-04-11 12:13:53,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:53,761 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:13:53,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:109 [2018-04-11 12:13:58,393 WARN L151 SmtUtils]: Spent 2019ms on a formula simplification. DAG size of input: 44 DAG size of output 37 [2018-04-11 12:13:58,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:58,451 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 27 [2018-04-11 12:13:58,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:58,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:58,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:58,471 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 22 treesize of output 25 [2018-04-11 12:13:58,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,483 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:13:58,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:92 [2018-04-11 12:13:58,526 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 36 treesize of output 44 [2018-04-11 12:13:58,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:58,529 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:13:58,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,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, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-04-11 12:13:58,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:58,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 85 [2018-04-11 12:13:58,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,577 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:13:58,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:114, output treesize:104 [2018-04-11 12:13:58,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:58,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:58,662 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 46 treesize of output 71 [2018-04-11 12:13:58,664 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:13:58,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:58,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:58,692 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 148 [2018-04-11 12:13:58,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:13:58,693 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,718 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:13:58,718 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:146, output treesize:130 [2018-04-11 12:13:58,892 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2018-04-11 12:13:58,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:13:58,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:13:58,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:58,928 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 138 treesize of output 146 [2018-04-11 12:13:58,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 12:13:58,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:13:58,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:13:58,995 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:13:58,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:153, output treesize:261 [2018-04-11 12:13:59,098 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 57 treesize of output 76 [2018-04-11 12:13:59,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:59,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 12:13:59,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:59,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:59,138 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 139 treesize of output 132 [2018-04-11 12:13:59,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:59,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 12:13:59,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:59,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:59,177 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:13:59,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:162, output treesize:146 [2018-04-11 12:13:59,342 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 140 treesize of output 105 [2018-04-11 12:13:59,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 81 treesize of output 54 [2018-04-11 12:13:59,346 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:13:59,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:59,364 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:13:59,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:59,376 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:13:59,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:59,385 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:13:59,401 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 44 treesize of output 46 [2018-04-11 12:13:59,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:13:59,403 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:13:59,403 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:59,411 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:13:59,411 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:59,415 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:13:59,415 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:13:59,424 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:13:59,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:13:59,434 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:164, output treesize:18 [2018-04-11 12:13:59,533 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:13:59,551 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:13:59,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2018-04-11 12:13:59,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 12:13:59,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 12:13:59,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1427, Unknown=2, NotChecked=0, Total=1640 [2018-04-11 12:13:59,552 INFO L87 Difference]: Start difference. First operand 532 states and 596 transitions. Second operand 41 states. [2018-04-11 12:14:01,975 WARN L151 SmtUtils]: Spent 2102ms on a formula simplification. DAG size of input: 65 DAG size of output 52 [2018-04-11 12:14:02,757 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 116 DAG size of output 87 [2018-04-11 12:14:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:14:05,526 INFO L93 Difference]: Finished difference Result 1140 states and 1267 transitions. [2018-04-11 12:14:05,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 12:14:05,526 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2018-04-11 12:14:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:14:05,527 INFO L225 Difference]: With dead ends: 1140 [2018-04-11 12:14:05,528 INFO L226 Difference]: Without dead ends: 1140 [2018-04-11 12:14:05,529 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2075 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1318, Invalid=5986, Unknown=6, NotChecked=0, Total=7310 [2018-04-11 12:14:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-04-11 12:14:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 539. [2018-04-11 12:14:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-04-11 12:14:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 602 transitions. [2018-04-11 12:14:05,534 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 602 transitions. Word has length 76 [2018-04-11 12:14:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:14:05,534 INFO L459 AbstractCegarLoop]: Abstraction has 539 states and 602 transitions. [2018-04-11 12:14:05,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 12:14:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 602 transitions. [2018-04-11 12:14:05,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 12:14:05,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:14:05,535 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, 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:14:05,535 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:14:05,535 INFO L82 PathProgramCache]: Analyzing trace with hash 246978595, now seen corresponding path program 1 times [2018-04-11 12:14:05,536 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:14:05,536 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:14:05,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:14:05,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:14:05,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:14:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:14:05,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:14:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 12:14:05,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:14:05,826 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:14:05,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:14:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:14:05,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:14:05,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 12:14:05,951 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:14:05,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:14:05,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:14:05,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:14:05,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 12:14:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:14:06,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:14:06,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2018-04-11 12:14:06,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 12:14:06,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 12:14:06,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2018-04-11 12:14:06,067 INFO L87 Difference]: Start difference. First operand 539 states and 602 transitions. Second operand 23 states. [2018-04-11 12:14:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:14:07,547 INFO L93 Difference]: Finished difference Result 737 states and 807 transitions. [2018-04-11 12:14:07,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 12:14:07,548 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-04-11 12:14:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:14:07,549 INFO L225 Difference]: With dead ends: 737 [2018-04-11 12:14:07,549 INFO L226 Difference]: Without dead ends: 638 [2018-04-11 12:14:07,550 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=521, Invalid=3639, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 12:14:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-04-11 12:14:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 586. [2018-04-11 12:14:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-04-11 12:14:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 672 transitions. [2018-04-11 12:14:07,553 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 672 transitions. Word has length 79 [2018-04-11 12:14:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:14:07,553 INFO L459 AbstractCegarLoop]: Abstraction has 586 states and 672 transitions. [2018-04-11 12:14:07,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 12:14:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 672 transitions. [2018-04-11 12:14:07,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 12:14:07,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:14:07,554 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, 1, 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:14:07,554 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:14:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1394186197, now seen corresponding path program 1 times [2018-04-11 12:14:07,554 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:14:07,554 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:14:07,554 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:14:07,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:14:07,555 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:14:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:14:07,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:14:08,238 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:14:08,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:14:08,238 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:14:08,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:14:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:14:08,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:14:08,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:08,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:08,306 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:14:08,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:08,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:14:08,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 12:14:08,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 12:14:08,332 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 10 treesize of output 9 [2018-04-11 12:14:08,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:08,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:14:08,337 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:14:08,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 12:14:08,382 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 45 treesize of output 39 [2018-04-11 12:14:08,383 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:14:08,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:08,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:14:08,390 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:14:08,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-11 12:14:08,445 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 46 [2018-04-11 12:14:08,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 29 [2018-04-11 12:14:08,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:08,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:14:08,467 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:14:08,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:58 [2018-04-11 12:14:11,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,017 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 28 treesize of output 58 [2018-04-11 12:14:11,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,027 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:14:11,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:70 [2018-04-11 12:14:11,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 61 [2018-04-11 12:14:11,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 70 [2018-04-11 12:14:11,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,090 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:14:11,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-04-11 12:14:11,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,183 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 120 [2018-04-11 12:14:11,185 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:14:11,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,214 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:14:11,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:95 [2018-04-11 12:14:11,373 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 99 treesize of output 107 [2018-04-11 12:14:11,387 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:14:11,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:14:11,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:14:11,427 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:14:11,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:182 [2018-04-11 12:14:11,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,509 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 37 treesize of output 97 [2018-04-11 12:14:11,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,533 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:14:11,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:97, output treesize:113 [2018-04-11 12:14:11,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,607 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 109 treesize of output 111 [2018-04-11 12:14:11,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:14:11,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,636 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:14:11,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:137 [2018-04-11 12:14:11,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:11,761 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 152 treesize of output 163 [2018-04-11 12:14:11,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:14:11,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,795 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:14:11,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:160, output treesize:150 [2018-04-11 12:14:11,930 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 196 treesize of output 160 [2018-04-11 12:14:11,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2018-04-11 12:14:11,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:14:11,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 12:14:11,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:204, output treesize:190 [2018-04-11 12:14:14,819 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 113 [2018-04-11 12:14:14,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:14:14,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 43 treesize of output 28 [2018-04-11 12:14:14,822 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:14:14,836 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:14:14,836 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:14,848 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:14:14,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:14:14,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2018-04-11 12:14:14,857 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:14:14,864 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:14:14,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 12:14:14,872 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:184, output treesize:45 [2018-04-11 12:14:14,996 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:14:15,019 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:14:15,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 53 [2018-04-11 12:14:15,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 12:14:15,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 12:14:15,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2404, Unknown=9, NotChecked=0, Total=2862 [2018-04-11 12:14:15,020 INFO L87 Difference]: Start difference. First operand 586 states and 672 transitions. Second operand 54 states. [2018-04-11 12:14:48,063 WARN L151 SmtUtils]: Spent 4107ms on a formula simplification. DAG size of input: 107 DAG size of output 100 [2018-04-11 12:14:58,209 WARN L151 SmtUtils]: Spent 4087ms on a formula simplification. DAG size of input: 103 DAG size of output 96 [2018-04-11 12:15:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:15:06,840 INFO L93 Difference]: Finished difference Result 1399 states and 1615 transitions. [2018-04-11 12:15:06,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-11 12:15:06,841 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 81 [2018-04-11 12:15:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:15:06,843 INFO L225 Difference]: With dead ends: 1399 [2018-04-11 12:15:06,843 INFO L226 Difference]: Without dead ends: 1399 [2018-04-11 12:15:06,845 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3269 ImplicationChecksByTransitivity, 47.7s TimeCoverageRelationStatistics Valid=2470, Invalid=10153, Unknown=33, NotChecked=0, Total=12656 [2018-04-11 12:15:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-04-11 12:15:06,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 586. [2018-04-11 12:15:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-04-11 12:15:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 671 transitions. [2018-04-11 12:15:06,851 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 671 transitions. Word has length 81 [2018-04-11 12:15:06,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:15:06,851 INFO L459 AbstractCegarLoop]: Abstraction has 586 states and 671 transitions. [2018-04-11 12:15:06,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 12:15:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 671 transitions. [2018-04-11 12:15:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 12:15:06,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:15:06,852 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, 1, 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:15:06,852 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:15:06,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1394186196, now seen corresponding path program 1 times [2018-04-11 12:15:06,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:15:06,852 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:15:06,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:15:06,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:15:06,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:15:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:15:06,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:15:07,737 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:15:07,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:15:07,737 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:15:07,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:15:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:15:07,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:15:07,794 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:15:07,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:07,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:07,802 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:15:07,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-11 12:15:07,845 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 13 treesize of output 10 [2018-04-11 12:15:07,846 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 10 treesize of output 9 [2018-04-11 12:15:07,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,855 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 13 treesize of output 10 [2018-04-11 12:15:07,857 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 10 treesize of output 9 [2018-04-11 12:15:07,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,858 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,864 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:15:07,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:50 [2018-04-11 12:15:07,903 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 33 treesize of output 34 [2018-04-11 12:15:07,904 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:15:07,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,920 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 69 treesize of output 63 [2018-04-11 12:15:07,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:15:07,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:07,934 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:15:07,934 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:96, output treesize:76 [2018-04-11 12:15:08,012 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 109 treesize of output 95 [2018-04-11 12:15:08,014 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 29 [2018-04-11 12:15:08,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:08,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:08,035 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 48 treesize of output 41 [2018-04-11 12:15:08,037 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 29 [2018-04-11 12:15:08,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:08,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:08,058 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:15:08,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:126, output treesize:106 [2018-04-11 12:15:14,127 WARN L151 SmtUtils]: Spent 2033ms on a formula simplification. DAG size of input: 43 DAG size of output 36 [2018-04-11 12:15:14,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,172 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 27 [2018-04-11 12:15:14,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,189 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 28 treesize of output 58 [2018-04-11 12:15:14,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,207 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:15:14,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:110 [2018-04-11 12:15:14,259 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 84 treesize of output 83 [2018-04-11 12:15:14,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 96 [2018-04-11 12:15:14,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,292 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 36 treesize of output 44 [2018-04-11 12:15:14,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:15:14,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,315 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:15:14,315 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:132, output treesize:126 [2018-04-11 12:15:14,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,437 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 176 [2018-04-11 12:15:14,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:15:14,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 71 [2018-04-11 12:15:14,485 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:15:14,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,508 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:15:14,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:168, output treesize:152 [2018-04-11 12:15:14,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2018-04-11 12:15:14,706 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:14,706 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:15:14,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,744 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 158 treesize of output 166 [2018-04-11 12:15:14,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 2 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 12:15:14,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:15:14,777 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:15:14,826 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:15:14,826 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:175, output treesize:305 [2018-04-11 12:15:14,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:14,945 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 31 treesize of output 55 [2018-04-11 12:15:14,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-11 12:15:14,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:14,985 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:15:14,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:152, output treesize:143 [2018-04-11 12:15:15,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:15,054 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 135 treesize of output 137 [2018-04-11 12:15:15,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:15,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:15:15,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,106 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2018-04-11 12:15:15,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:15,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 12:15:15,109 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,139 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:15:15,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:169, output treesize:167 [2018-04-11 12:15:15,278 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 122 [2018-04-11 12:15:15,280 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:15:15,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:15,329 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 191 treesize of output 202 [2018-04-11 12:15:15,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 12:15:15,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,374 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:15:15,374 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:213, output treesize:193 [2018-04-11 12:15:15,543 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 145 [2018-04-11 12:15:15,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 26 treesize of output 37 [2018-04-11 12:15:15,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,599 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 214 [2018-04-11 12:15:15,601 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 26 treesize of output 37 [2018-04-11 12:15:15,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:15,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 12:15:15,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:284, output treesize:256 [2018-04-11 12:15:19,838 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 157 [2018-04-11 12:15:19,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:19,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 67 treesize of output 44 [2018-04-11 12:15:19,842 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:15:19,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 7 treesize of output 1 [2018-04-11 12:15:19,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:19,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 47 [2018-04-11 12:15:19,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:15:19,894 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:15:19,894 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:19,907 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:15:19,925 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 59 [2018-04-11 12:15:19,927 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:15:19,927 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:19,936 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:15:19,936 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:19,941 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:15:19,941 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:19,945 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:15:19,946 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:19,948 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:19,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 12:15:19,955 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:253, output treesize:31 [2018-04-11 12:15:20,088 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:15:20,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:15:20,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 48 [2018-04-11 12:15:20,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 12:15:20,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 12:15:20,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2078, Unknown=4, NotChecked=0, Total=2352 [2018-04-11 12:15:20,105 INFO L87 Difference]: Start difference. First operand 586 states and 671 transitions. Second operand 49 states. [2018-04-11 12:15:22,521 WARN L151 SmtUtils]: Spent 2031ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-04-11 12:15:23,274 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 136 DAG size of output 92 [2018-04-11 12:15:23,576 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 159 DAG size of output 92 [2018-04-11 12:15:24,339 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 114 DAG size of output 100 [2018-04-11 12:15:28,580 WARN L151 SmtUtils]: Spent 4158ms on a formula simplification. DAG size of input: 152 DAG size of output 134 [2018-04-11 12:15:32,755 WARN L151 SmtUtils]: Spent 4134ms on a formula simplification. DAG size of input: 147 DAG size of output 131 [2018-04-11 12:15:32,954 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 151 DAG size of output 135 [2018-04-11 12:15:33,170 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 149 DAG size of output 135 [2018-04-11 12:15:37,354 WARN L151 SmtUtils]: Spent 4136ms on a formula simplification. DAG size of input: 145 DAG size of output 131 [2018-04-11 12:15:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:15:40,842 INFO L93 Difference]: Finished difference Result 1399 states and 1611 transitions. [2018-04-11 12:15:40,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-11 12:15:40,842 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 81 [2018-04-11 12:15:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:15:40,845 INFO L225 Difference]: With dead ends: 1399 [2018-04-11 12:15:40,845 INFO L226 Difference]: Without dead ends: 1399 [2018-04-11 12:15:40,845 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2438 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=1502, Invalid=8000, Unknown=4, NotChecked=0, Total=9506 [2018-04-11 12:15:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-04-11 12:15:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 563. [2018-04-11 12:15:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-04-11 12:15:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 643 transitions. [2018-04-11 12:15:40,850 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 643 transitions. Word has length 81 [2018-04-11 12:15:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:15:40,850 INFO L459 AbstractCegarLoop]: Abstraction has 563 states and 643 transitions. [2018-04-11 12:15:40,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 12:15:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 643 transitions. [2018-04-11 12:15:40,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 12:15:40,851 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:15:40,851 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:40,851 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:15:40,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1486032057, now seen corresponding path program 1 times [2018-04-11 12:15:40,851 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:15:40,851 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:15:40,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:15:40,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:15:40,852 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:15:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:15:40,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:15:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:15:41,615 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:15:41,616 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:15:41,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:15:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:15:41,645 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:15:41,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:41,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:41,673 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:15:41,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 12:15:41,692 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:15:41,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:15:41,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,699 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:15:41,700 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:15:41,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,704 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:15:41,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-11 12:15:41,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:41,741 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:15:41,742 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:15:41,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:41,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-04-11 12:15:41,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:15:41,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,765 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:15:41,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:48 [2018-04-11 12:15:41,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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:15:41,848 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:15:41,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:15:41,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:15:41,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-04-11 12:15:41,880 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:41,881 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:15:41,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-04-11 12:15:41,898 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:15:41,898 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 12:15:41,910 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:15:41,931 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:15:41,931 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:81, output treesize:135 [2018-04-11 12:15:41,973 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 88 treesize of output 83 [2018-04-11 12:15:41,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:41,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-04-11 12:15:41,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:41,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:42,002 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 81 treesize of output 71 [2018-04-11 12:15:42,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:42,006 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 28 treesize of output 47 [2018-04-11 12:15:42,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:42,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:42,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:42,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:80 [2018-04-11 12:15:42,133 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 107 treesize of output 86 [2018-04-11 12:15:42,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:42,135 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 32 treesize of output 29 [2018-04-11 12:15:42,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:42,143 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 50 treesize of output 42 [2018-04-11 12:15:42,143 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:15:42,148 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:15:42,156 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 52 treesize of output 40 [2018-04-11 12:15:42,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:42,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-11 12:15:42,158 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:42,164 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 16 treesize of output 7 [2018-04-11 12:15:42,164 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:42,166 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:42,169 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:15:42,169 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:7 [2018-04-11 12:15:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:15:42,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:15:42,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 35 [2018-04-11 12:15:42,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 12:15:42,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 12:15:42,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1095, Unknown=2, NotChecked=0, Total=1190 [2018-04-11 12:15:42,233 INFO L87 Difference]: Start difference. First operand 563 states and 643 transitions. Second operand 35 states. [2018-04-11 12:15:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:15:44,396 INFO L93 Difference]: Finished difference Result 783 states and 884 transitions. [2018-04-11 12:15:44,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 12:15:44,396 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 82 [2018-04-11 12:15:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:15:44,398 INFO L225 Difference]: With dead ends: 783 [2018-04-11 12:15:44,398 INFO L226 Difference]: Without dead ends: 783 [2018-04-11 12:15:44,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=543, Invalid=3487, Unknown=2, NotChecked=0, Total=4032 [2018-04-11 12:15:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-04-11 12:15:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 617. [2018-04-11 12:15:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-04-11 12:15:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 701 transitions. [2018-04-11 12:15:44,402 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 701 transitions. Word has length 82 [2018-04-11 12:15:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:15:44,402 INFO L459 AbstractCegarLoop]: Abstraction has 617 states and 701 transitions. [2018-04-11 12:15:44,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 12:15:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 701 transitions. [2018-04-11 12:15:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-04-11 12:15:44,403 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:15:44,403 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:44,404 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:15:44,404 INFO L82 PathProgramCache]: Analyzing trace with hash 337170069, now seen corresponding path program 1 times [2018-04-11 12:15:44,404 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:15:44,404 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:15:44,404 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:15:44,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:15:44,405 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:15:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:15:44,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:15:44,634 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:15:44,634 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:15:44,634 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:15:44,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:15:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:15:44,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:15:44,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 12:15:44,823 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:44,823 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 15 treesize of output 11 [2018-04-11 12:15:44,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:44,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:44,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 12:15:44,832 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:44,832 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 15 treesize of output 11 [2018-04-11 12:15:44,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:44,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:44,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:44,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:7 [2018-04-11 12:15:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 12:15:44,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:15:44,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2018-04-11 12:15:44,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 12:15:44,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 12:15:44,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-04-11 12:15:44,893 INFO L87 Difference]: Start difference. First operand 617 states and 701 transitions. Second operand 26 states. [2018-04-11 12:15:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:15:47,238 INFO L93 Difference]: Finished difference Result 767 states and 834 transitions. [2018-04-11 12:15:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 12:15:47,238 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 82 [2018-04-11 12:15:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:15:47,240 INFO L225 Difference]: With dead ends: 767 [2018-04-11 12:15:47,240 INFO L226 Difference]: Without dead ends: 767 [2018-04-11 12:15:47,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1138, Invalid=5342, Unknown=0, NotChecked=0, Total=6480 [2018-04-11 12:15:47,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-04-11 12:15:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 602. [2018-04-11 12:15:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-04-11 12:15:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 678 transitions. [2018-04-11 12:15:47,244 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 678 transitions. Word has length 82 [2018-04-11 12:15:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:15:47,244 INFO L459 AbstractCegarLoop]: Abstraction has 602 states and 678 transitions. [2018-04-11 12:15:47,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 12:15:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 678 transitions. [2018-04-11 12:15:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 12:15:47,244 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:15:47,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 12:15:47,245 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:15:47,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2031816585, now seen corresponding path program 2 times [2018-04-11 12:15:47,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:15:47,245 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:15:47,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:15:47,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:15:47,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:15:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:15:47,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:15:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:15:47,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:15:47,599 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:15:47,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 12:15:47,630 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 12:15:47,630 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 12:15:47,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:15:47,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:47,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:47,675 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:15:47,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-11 12:15:47,698 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:15:47,700 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:15:47,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:15:47,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 12:15:47,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,719 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:15:47,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 12:15:47,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:47,758 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:15:47,760 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:15:47,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:47,775 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:15:47,776 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:15:47,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,787 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:15:47,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-04-11 12:15:47,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-11 12:15:47,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-11 12:15:47,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:15:47,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:15:47,905 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 74 treesize of output 91 [2018-04-11 12:15:47,907 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:47,907 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 38 [2018-04-11 12:15:47,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,917 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:47,919 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 74 treesize of output 78 [2018-04-11 12:15:47,920 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:47,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-11 12:15:47,921 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,928 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:47,949 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:15:47,949 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:87, output treesize:171 [2018-04-11 12:15:47,994 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 89 treesize of output 79 [2018-04-11 12:15:47,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:47,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 28 treesize of output 47 [2018-04-11 12:15:47,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:48,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:48,014 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 80 treesize of output 75 [2018-04-11 12:15:48,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:48,016 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 28 treesize of output 47 [2018-04-11 12:15:48,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:48,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:48,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:48,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:102, output treesize:86 [2018-04-11 12:15:48,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:48,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 95 [2018-04-11 12:15:48,156 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:48,156 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 61 treesize of output 43 [2018-04-11 12:15:48,157 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:15:48,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:48,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:48,166 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:48,166 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 54 [2018-04-11 12:15:48,167 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:48,174 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:15:48,184 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 38 [2018-04-11 12:15:48,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:48,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:48,186 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:48,187 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 38 [2018-04-11 12:15:48,187 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:48,193 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:48,194 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 16 treesize of output 10 [2018-04-11 12:15:48,194 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:48,196 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:48,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:48,201 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:122, output treesize:7 [2018-04-11 12:15:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 8 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:15:48,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:15:48,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 31 [2018-04-11 12:15:48,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 12:15:48,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 12:15:48,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=824, Unknown=5, NotChecked=0, Total=930 [2018-04-11 12:15:48,255 INFO L87 Difference]: Start difference. First operand 602 states and 678 transitions. Second operand 31 states. [2018-04-11 12:15:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 12:15:53,316 INFO L93 Difference]: Finished difference Result 806 states and 889 transitions. [2018-04-11 12:15:53,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 12:15:53,317 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-04-11 12:15:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 12:15:53,318 INFO L225 Difference]: With dead ends: 806 [2018-04-11 12:15:53,318 INFO L226 Difference]: Without dead ends: 806 [2018-04-11 12:15:53,318 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=672, Invalid=3342, Unknown=18, NotChecked=0, Total=4032 [2018-04-11 12:15:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-04-11 12:15:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 654. [2018-04-11 12:15:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-04-11 12:15:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 742 transitions. [2018-04-11 12:15:53,322 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 742 transitions. Word has length 84 [2018-04-11 12:15:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 12:15:53,322 INFO L459 AbstractCegarLoop]: Abstraction has 654 states and 742 transitions. [2018-04-11 12:15:53,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 12:15:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 742 transitions. [2018-04-11 12:15:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-11 12:15:53,323 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 12:15:53,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:53,323 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr70EnsuresViolationMEMORY_LEAK, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr69AssertViolationMEMORY_FREE, mainErr67RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 12:15:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1072416019, now seen corresponding path program 1 times [2018-04-11 12:15:53,323 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 12:15:53,323 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 12:15:53,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:15:53,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 12:15:53,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 12:15:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:15:53,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 12:15:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:15:53,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 12:15:53,945 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:15:53,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 12:15:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 12:15:53,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 12:15:53,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,000 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:15:54,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 12:15:54,037 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:15:54,038 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:15:54,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,047 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:15:54,048 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:15:54,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,050 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,055 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:15:54,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-11 12:15:54,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,097 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:15:54,098 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:15:54,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 47 [2018-04-11 12:15:54,113 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:15:54,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,123 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:15:54,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:53 [2018-04-11 12:15:54,204 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:15:54,211 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:15:54,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 12:15:54,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:15:54,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-04-11 12:15:54,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 31 [2018-04-11 12:15:54,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 12:15:54,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 12:15:54,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-04-11 12:15:54,274 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 12:15:54,275 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:15:54,275 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,282 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,306 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:15:54,306 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:91, output treesize:155 [2018-04-11 12:15:54,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-04-11 12:15:54,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:83 [2018-04-11 12:15:54,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 60 [2018-04-11 12:15:54,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,417 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 24 treesize of output 39 [2018-04-11 12:15:54,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,453 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 77 treesize of output 76 [2018-04-11 12:15:54,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,456 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 20 treesize of output 31 [2018-04-11 12:15:54,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,484 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:15:54,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:101 [2018-04-11 12:15:54,590 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 64 treesize of output 87 [2018-04-11 12:15:54,592 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:15:54,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 12:15:54,632 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 118 treesize of output 116 [2018-04-11 12:15:54,634 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:15:54,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,657 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:15:54,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:127 [2018-04-11 12:15:54,753 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 231 treesize of output 176 [2018-04-11 12:15:54,756 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 30 treesize of output 45 [2018-04-11 12:15:54,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,793 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 203 treesize of output 181 [2018-04-11 12:15:54,796 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 30 treesize of output 45 [2018-04-11 12:15:54,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:15:54,824 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:15:54,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:243, output treesize:207 [2018-04-11 12:16:00,893 WARN L151 SmtUtils]: Spent 2028ms on a formula simplification. DAG size of input: 51 DAG size of output 44 [2018-04-11 12:16:00,948 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 150 treesize of output 135 [2018-04-11 12:16:00,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-11 12:16:00,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:16:00,960 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:16:00,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:16:00,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 12:16:00,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 12:16:00,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 12:16:00,985 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:16:00,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:179, output treesize:110 [2018-04-11 12:16:03,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 57 [2018-04-11 12:16:03,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2018-04-11 12:16:03,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 12:16:03,070 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:16:03,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 12:16:03,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:16:03,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 12:16:03,083 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:16:03,087 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:16:03,088 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:28 [2018-04-11 12:16:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 12:16:03,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 12:16:03,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-04-11 12:16:03,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-11 12:16:03,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-11 12:16:03,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1639, Unknown=3, NotChecked=0, Total=1806 [2018-04-11 12:16:03,194 INFO L87 Difference]: Start difference. First operand 654 states and 742 transitions. Second operand 43 states. Received shutdown request... [2018-04-11 12:16:20,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 12:16:20,223 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 12:16:20,227 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 12:16:20,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 12:16:20 BoogieIcfgContainer [2018-04-11 12:16:20,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 12:16:20,229 INFO L168 Benchmark]: Toolchain (without parser) took 196374.47 ms. Allocated memory was 405.8 MB in the beginning and 763.9 MB in the end (delta: 358.1 MB). Free memory was 338.2 MB in the beginning and 623.6 MB in the end (delta: -285.4 MB). Peak memory consumption was 72.7 MB. Max. memory is 5.3 GB. [2018-04-11 12:16:20,230 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 405.8 MB. Free memory is still 364.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 12:16:20,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.65 ms. Allocated memory is still 405.8 MB. Free memory was 338.2 MB in the beginning and 311.2 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. [2018-04-11 12:16:20,230 INFO L168 Benchmark]: Boogie Preprocessor took 48.83 ms. Allocated memory is still 405.8 MB. Free memory was 309.9 MB in the beginning and 307.2 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:16:20,230 INFO L168 Benchmark]: RCFGBuilder took 601.61 ms. Allocated memory was 405.8 MB in the beginning and 594.5 MB in the end (delta: 188.7 MB). Free memory was 307.2 MB in the beginning and 500.9 MB in the end (delta: -193.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-11 12:16:20,230 INFO L168 Benchmark]: TraceAbstraction took 195427.57 ms. Allocated memory was 594.5 MB in the beginning and 763.9 MB in the end (delta: 169.3 MB). Free memory was 500.9 MB in the beginning and 623.6 MB in the end (delta: -122.7 MB). Peak memory consumption was 46.6 MB. Max. memory is 5.3 GB. [2018-04-11 12:16:20,232 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.18 ms. Allocated memory is still 405.8 MB. Free memory is still 364.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 293.65 ms. Allocated memory is still 405.8 MB. Free memory was 338.2 MB in the beginning and 311.2 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.83 ms. Allocated memory is still 405.8 MB. Free memory was 309.9 MB in the beginning and 307.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 601.61 ms. Allocated memory was 405.8 MB in the beginning and 594.5 MB in the end (delta: 188.7 MB). Free memory was 307.2 MB in the beginning and 500.9 MB in the end (delta: -193.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 195427.57 ms. Allocated memory was 594.5 MB in the beginning and 763.9 MB in the end (delta: 169.3 MB). Free memory was 500.9 MB in the beginning and 623.6 MB in the end (delta: -122.7 MB). Peak memory consumption was 46.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1020]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1028]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1045). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1040). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1047). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1028]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1028). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 994]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 994). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 989]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 989). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1020]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (654states) and interpolant automaton (currently 18 states, 43 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 58 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 199 locations, 71 error locations. TIMEOUT Result, 195.3s OverallTime, 44 OverallIterations, 3 TraceHistogramMax, 141.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6753 SDtfs, 34818 SDslu, 44797 SDs, 0 SdLazy, 38612 SolverSat, 3045 SolverUnsat, 234 SolverUnknown, 0 SolverNotchecked, 42.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2315 GetRequests, 970 SyntacticMatches, 62 SemanticMatches, 1282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19447 ImplicationChecksByTransitivity, 135.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=654occurred in iteration=43, 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.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 7158 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 52.3s InterpolantComputationTime, 3399 NumberOfCodeBlocks, 3399 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 3340 ConstructedInterpolants, 406 QuantifiedInterpolants, 6473813 SizeOfPredicates, 238 NumberOfNonLiveVariables, 3535 ConjunctsInSsa, 631 ConjunctsInUnsatCore, 59 InterpolantComputations, 29 PerfectInterpolantSequences, 57/199 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-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_12-16-20-238.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-01_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_12-16-20-238.csv Completed graceful shutdown