java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8168ed2-m [2018-04-11 23:57:16,273 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 23:57:16,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 23:57:16,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 23:57:16,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 23:57:16,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 23:57:16,289 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 23:57:16,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 23:57:16,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 23:57:16,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 23:57:16,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 23:57:16,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 23:57:16,296 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 23:57:16,298 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 23:57:16,298 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 23:57:16,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 23:57:16,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 23:57:16,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 23:57:16,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 23:57:16,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 23:57:16,310 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 23:57:16,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 23:57:16,310 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 23:57:16,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 23:57:16,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 23:57:16,314 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 23:57:16,314 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 23:57:16,315 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 23:57:16,315 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 23:57:16,316 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 23:57:16,316 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 23:57:16,317 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-11 23:57:16,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 23:57:16,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 23:57:16,340 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 23:57:16,341 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 23:57:16,341 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 23:57:16,341 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 23:57:16,341 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 23:57:16,342 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 23:57:16,342 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 23:57:16,342 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 23:57:16,342 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 23:57:16,342 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 23:57:16,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 23:57:16,343 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 23:57:16,343 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 23:57:16,343 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 23:57:16,343 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 23:57:16,343 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 23:57:16,343 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 23:57:16,343 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 23:57:16,344 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 23:57:16,344 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 23:57:16,344 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 23:57:16,344 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 23:57:16,344 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 23:57:16,345 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 23:57:16,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 23:57:16,345 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 23:57:16,345 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 23:57:16,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 23:57:16,345 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 23:57:16,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 23:57:16,346 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:16,346 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 23:57:16,347 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 23:57:16,347 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 23:57:16,347 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 23:57:16,347 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 23:57:16,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 23:57:16,389 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 23:57:16,392 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 23:57:16,394 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 23:57:16,394 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 23:57:16,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,695 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7b886f7dd [2018-04-11 23:57:16,889 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 23:57:16,889 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 23:57:16,890 INFO L168 CDTParser]: Scanning dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,901 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 23:57:16,902 INFO L215 ultiparseSymbolTable]: [2018-04-11 23:57:16,902 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 23:57:16,902 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,902 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 23:57:16,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,902 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__uid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fd_set in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,903 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_char in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____off64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_long in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,904 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__div_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int16_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__time_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__size_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_char in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,905 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__gid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ino_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__clock_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int16_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,906 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ulong in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int8_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____mode_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_long in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____time_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,907 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_short in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_short in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,908 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int8_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__mode_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____dev_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____clock_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____loff_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__id_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,909 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__dev_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____key_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,910 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__uint in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__loff_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ushort in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____ino_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,911 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__register_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__quad_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_int in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__off_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,912 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int32_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____gid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____off_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____quad_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,913 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__Colour in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____pid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__key_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____timer_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,914 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int32_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__timer_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,915 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____id_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,916 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:16,937 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG7b886f7dd [2018-04-11 23:57:16,942 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 23:57:16,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 23:57:16,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 23:57:16,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 23:57:16,950 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 23:57:16,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:57:16" (1/1) ... [2018-04-11 23:57:16,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2fadd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:16, skipping insertion in model container [2018-04-11 23:57:16,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:57:16" (1/1) ... [2018-04-11 23:57:16,967 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:57:16,999 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:57:17,171 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:57:17,227 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:57:17,235 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 23:57:17,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:17 WrapperNode [2018-04-11 23:57:17,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 23:57:17,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 23:57:17,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 23:57:17,290 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 23:57:17,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:17" (1/1) ... [2018-04-11 23:57:17,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:17" (1/1) ... [2018-04-11 23:57:17,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:17" (1/1) ... [2018-04-11 23:57:17,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:17" (1/1) ... [2018-04-11 23:57:17,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:17" (1/1) ... [2018-04-11 23:57:17,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:17" (1/1) ... [2018-04-11 23:57:17,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:17" (1/1) ... [2018-04-11 23:57:17,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 23:57:17,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 23:57:17,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 23:57:17,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 23:57:17,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:17" (1/1) ... No working directory specified, using /storage/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 23:57:17,477 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 23:57:17,478 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 23:57:17,478 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 23:57:17,478 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 23:57:17,478 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 23:57:17,478 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 23:57:17,478 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 23:57:17,478 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 23:57:17,478 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 23:57:17,478 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 23:57:17,479 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 23:57:17,479 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 23:57:17,479 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 23:57:17,479 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 23:57:17,479 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 23:57:17,479 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 23:57:17,479 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 23:57:17,479 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 23:57:17,479 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 23:57:17,479 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 23:57:17,480 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 23:57:17,480 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 23:57:17,480 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 23:57:17,480 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 23:57:17,480 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 23:57:17,480 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 23:57:17,480 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 23:57:17,480 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 23:57:17,480 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 23:57:17,480 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 23:57:17,481 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 23:57:17,482 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 23:57:17,483 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 23:57:17,484 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 23:57:17,484 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 23:57:17,484 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 23:57:17,484 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 23:57:17,484 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 23:57:17,484 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 23:57:17,484 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 23:57:17,484 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 23:57:17,485 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 23:57:17,485 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 23:57:17,485 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 23:57:17,485 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 23:57:17,485 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 23:57:17,485 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 23:57:17,485 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 23:57:17,485 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 23:57:17,486 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 23:57:17,486 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 23:57:17,486 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 23:57:17,486 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 23:57:17,486 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 23:57:17,486 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 23:57:17,486 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 23:57:17,487 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 23:57:17,487 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 23:57:17,487 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 23:57:17,487 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 23:57:17,487 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 23:57:17,487 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 23:57:17,487 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 23:57:17,487 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 23:57:17,488 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 23:57:17,488 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 23:57:17,488 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 23:57:17,488 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 23:57:17,488 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 23:57:17,488 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 23:57:17,488 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 23:57:17,488 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 23:57:17,489 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 23:57:17,489 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 23:57:17,489 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 23:57:17,489 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 23:57:17,489 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 23:57:17,489 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 23:57:17,489 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 23:57:17,489 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 23:57:17,490 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 23:57:17,490 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 23:57:17,490 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 23:57:17,490 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 23:57:17,490 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 23:57:17,490 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 23:57:18,076 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 23:57:18,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:57:18 BoogieIcfgContainer [2018-04-11 23:57:18,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 23:57:18,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 23:57:18,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 23:57:18,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 23:57:18,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:57:16" (1/3) ... [2018-04-11 23:57:18,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b80162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:57:18, skipping insertion in model container [2018-04-11 23:57:18,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:57:17" (2/3) ... [2018-04-11 23:57:18,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b80162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:57:18, skipping insertion in model container [2018-04-11 23:57:18,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:57:18" (3/3) ... [2018-04-11 23:57:18,084 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-04-11 23:57:18,093 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 23:57:18,099 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-04-11 23:57:18,145 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 23:57:18,146 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 23:57:18,146 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 23:57:18,146 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 23:57:18,146 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 23:57:18,146 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 23:57:18,146 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 23:57:18,146 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 23:57:18,146 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 23:57:18,147 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 23:57:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states. [2018-04-11 23:57:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-11 23:57:18,169 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:18,170 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:57:18,170 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1529905732, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:18,188 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:18,221 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:18,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:57:18,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:18,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:18,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:57:18,318 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 23:57:18,318 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:18,344 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 23:57:18,367 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:18,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 23:57:18,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 23:57:18,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 23:57:18,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 23:57:18,382 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 4 states. [2018-04-11 23:57:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:18,708 INFO L93 Difference]: Finished difference Result 409 states and 471 transitions. [2018-04-11 23:57:18,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 23:57:18,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-04-11 23:57:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:18,721 INFO L225 Difference]: With dead ends: 409 [2018-04-11 23:57:18,721 INFO L226 Difference]: Without dead ends: 218 [2018-04-11 23:57:18,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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 23:57:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-11 23:57:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2018-04-11 23:57:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-11 23:57:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 197 transitions. [2018-04-11 23:57:18,766 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 197 transitions. Word has length 9 [2018-04-11 23:57:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:18,766 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 197 transitions. [2018-04-11 23:57:18,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 23:57:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 197 transitions. [2018-04-11 23:57:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-04-11 23:57:18,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:18,767 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:57:18,767 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:18,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1529905731, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:18,773 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:18,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:18,795 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 23:57:18,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:18,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:18,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:57:18,841 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 23:57:18,842 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:18,923 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 23:57:18,943 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:18,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 23:57:18,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:57:18,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:57:18,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:57:18,945 INFO L87 Difference]: Start difference. First operand 190 states and 197 transitions. Second operand 6 states. [2018-04-11 23:57:19,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:19,149 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2018-04-11 23:57:19,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 23:57:19,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-04-11 23:57:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:19,152 INFO L225 Difference]: With dead ends: 190 [2018-04-11 23:57:19,152 INFO L226 Difference]: Without dead ends: 186 [2018-04-11 23:57:19,153 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 23:57:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-11 23:57:19,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-04-11 23:57:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 23:57:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 192 transitions. [2018-04-11 23:57:19,168 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 192 transitions. Word has length 9 [2018-04-11 23:57:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:19,169 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 192 transitions. [2018-04-11 23:57:19,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:57:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 192 transitions. [2018-04-11 23:57:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 23:57:19,169 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:19,170 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:57:19,170 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:19,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1847144014, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:19,179 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:19,198 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:19,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:57:19,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:19,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:19,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:57:19,226 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 23:57:19,226 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:19,230 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 23:57:19,250 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:19,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 23:57:19,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 23:57:19,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 23:57:19,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 23:57:19,252 INFO L87 Difference]: Start difference. First operand 186 states and 192 transitions. Second operand 4 states. [2018-04-11 23:57:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:19,395 INFO L93 Difference]: Finished difference Result 209 states and 220 transitions. [2018-04-11 23:57:19,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:57:19,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 23:57:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:19,397 INFO L225 Difference]: With dead ends: 209 [2018-04-11 23:57:19,397 INFO L226 Difference]: Without dead ends: 201 [2018-04-11 23:57:19,398 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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 23:57:19,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-11 23:57:19,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 180. [2018-04-11 23:57:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 23:57:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 187 transitions. [2018-04-11 23:57:19,411 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 187 transitions. Word has length 14 [2018-04-11 23:57:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:19,412 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 187 transitions. [2018-04-11 23:57:19,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 23:57:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 187 transitions. [2018-04-11 23:57:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 23:57:19,412 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:19,412 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:57:19,413 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1847144013, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:19,438 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:19,453 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:19,465 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 23:57:19,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:19,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:19,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:57:19,540 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 23:57:19,541 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:19,563 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 23:57:19,586 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:19,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 23:57:19,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:57:19,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:57:19,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:57:19,587 INFO L87 Difference]: Start difference. First operand 180 states and 187 transitions. Second operand 6 states. [2018-04-11 23:57:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:19,750 INFO L93 Difference]: Finished difference Result 209 states and 215 transitions. [2018-04-11 23:57:19,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:57:19,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-04-11 23:57:19,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:19,752 INFO L225 Difference]: With dead ends: 209 [2018-04-11 23:57:19,752 INFO L226 Difference]: Without dead ends: 201 [2018-04-11 23:57:19,753 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-11 23:57:19,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-11 23:57:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 188. [2018-04-11 23:57:19,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 23:57:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2018-04-11 23:57:19,765 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 14 [2018-04-11 23:57:19,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:19,765 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2018-04-11 23:57:19,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:57:19,765 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2018-04-11 23:57:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 23:57:19,766 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:19,766 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] [2018-04-11 23:57:19,766 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1495805674, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:19,773 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:19,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:19,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:19,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:19,801 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 23:57:19,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:19,807 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 23:57:19,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 23:57:19,820 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 23:57:19,820 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:19,846 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 23:57:19,878 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:19,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-11 23:57:19,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 23:57:19,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 23:57:19,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 23:57:19,880 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand 7 states. [2018-04-11 23:57:20,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:20,077 INFO L93 Difference]: Finished difference Result 207 states and 217 transitions. [2018-04-11 23:57:20,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 23:57:20,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-04-11 23:57:20,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:20,079 INFO L225 Difference]: With dead ends: 207 [2018-04-11 23:57:20,079 INFO L226 Difference]: Without dead ends: 191 [2018-04-11 23:57:20,080 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-04-11 23:57:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-04-11 23:57:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2018-04-11 23:57:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 23:57:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 185 transitions. [2018-04-11 23:57:20,089 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 185 transitions. Word has length 23 [2018-04-11 23:57:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:20,089 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 185 transitions. [2018-04-11 23:57:20,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 23:57:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2018-04-11 23:57:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 23:57:20,090 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:20,090 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] [2018-04-11 23:57:20,090 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:20,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1495805675, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:20,104 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:20,127 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:20,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:20,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-11 23:57:20,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:20,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:20,167 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 23:57:20,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,172 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 23:57:20,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 23:57:20,181 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 23:57:20,181 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:20,260 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 23:57:20,280 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:20,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-11 23:57:20,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 23:57:20,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 23:57:20,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 23:57:20,281 INFO L87 Difference]: Start difference. First operand 176 states and 185 transitions. Second operand 8 states. [2018-04-11 23:57:20,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:20,633 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2018-04-11 23:57:20,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 23:57:20,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-04-11 23:57:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:20,634 INFO L225 Difference]: With dead ends: 219 [2018-04-11 23:57:20,634 INFO L226 Difference]: Without dead ends: 210 [2018-04-11 23:57:20,635 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 23:57:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-11 23:57:20,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2018-04-11 23:57:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 23:57:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 184 transitions. [2018-04-11 23:57:20,641 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 184 transitions. Word has length 23 [2018-04-11 23:57:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:20,641 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 184 transitions. [2018-04-11 23:57:20,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 23:57:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2018-04-11 23:57:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 23:57:20,642 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:20,642 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:57:20,642 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1344791026, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:20,653 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:20,669 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:20,672 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 23:57:20,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:57:20,685 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 23:57:20,689 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 23:57:20,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,701 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 23:57:20,702 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 23:57:20,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,707 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 23:57:20,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-11 23:57:20,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 23:57:20,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 23:57:20,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,723 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 23:57:20,725 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 23:57:20,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:20,728 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 23:57:20,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-11 23:57:20,734 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 23:57:20,734 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:20,758 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 23:57:20,778 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:20,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-11 23:57:20,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 23:57:20,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 23:57:20,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 23:57:20,779 INFO L87 Difference]: Start difference. First operand 174 states and 184 transitions. Second operand 8 states. [2018-04-11 23:57:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:21,236 INFO L93 Difference]: Finished difference Result 282 states and 301 transitions. [2018-04-11 23:57:21,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 23:57:21,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-11 23:57:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:21,239 INFO L225 Difference]: With dead ends: 282 [2018-04-11 23:57:21,239 INFO L226 Difference]: Without dead ends: 281 [2018-04-11 23:57:21,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-04-11 23:57:21,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-11 23:57:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 173. [2018-04-11 23:57:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-11 23:57:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 183 transitions. [2018-04-11 23:57:21,249 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 183 transitions. Word has length 25 [2018-04-11 23:57:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:21,250 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-04-11 23:57:21,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 23:57:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 183 transitions. [2018-04-11 23:57:21,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 23:57:21,251 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:21,251 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:57:21,251 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:21,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1344791027, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:21,276 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:21,302 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:21,309 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 23:57:21,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:21,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:21,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:57:21,319 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 23:57:21,325 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 23:57:21,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:21,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:21,333 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 23:57:21,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-11 23:57:21,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 23:57:21,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 23:57:21,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:21,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:21,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:21,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-11 23:57:21,356 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 23:57:21,357 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:21,362 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 23:57:21,394 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:21,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-11 23:57:21,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 23:57:21,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 23:57:21,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 23:57:21,395 INFO L87 Difference]: Start difference. First operand 173 states and 183 transitions. Second operand 5 states. [2018-04-11 23:57:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:21,696 INFO L93 Difference]: Finished difference Result 245 states and 263 transitions. [2018-04-11 23:57:21,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:57:21,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-11 23:57:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:21,698 INFO L225 Difference]: With dead ends: 245 [2018-04-11 23:57:21,698 INFO L226 Difference]: Without dead ends: 244 [2018-04-11 23:57:21,698 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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 23:57:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-11 23:57:21,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 172. [2018-04-11 23:57:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-04-11 23:57:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 182 transitions. [2018-04-11 23:57:21,705 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 182 transitions. Word has length 25 [2018-04-11 23:57:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:21,706 INFO L459 AbstractCegarLoop]: Abstraction has 172 states and 182 transitions. [2018-04-11 23:57:21,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 23:57:21,706 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 182 transitions. [2018-04-11 23:57:21,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 23:57:21,706 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:21,707 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:57:21,707 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:21,707 INFO L82 PathProgramCache]: Analyzing trace with hash 2113019045, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:21,713 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:21,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:21,757 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 23:57:21,758 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:21,784 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 23:57:21,805 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:21,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 23:57:21,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 23:57:21,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 23:57:21,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 23:57:21,806 INFO L87 Difference]: Start difference. First operand 172 states and 182 transitions. Second operand 4 states. [2018-04-11 23:57:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:21,934 INFO L93 Difference]: Finished difference Result 258 states and 274 transitions. [2018-04-11 23:57:21,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:57:21,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-04-11 23:57:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:21,936 INFO L225 Difference]: With dead ends: 258 [2018-04-11 23:57:21,936 INFO L226 Difference]: Without dead ends: 255 [2018-04-11 23:57:21,936 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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 23:57:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-11 23:57:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 182. [2018-04-11 23:57:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-11 23:57:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-04-11 23:57:21,946 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 28 [2018-04-11 23:57:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:21,947 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-04-11 23:57:21,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 23:57:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-04-11 23:57:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 23:57:21,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:21,948 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] [2018-04-11 23:57:21,948 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:21,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1076965014, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:21,958 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:21,985 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:21,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:21,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:21,999 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 23:57:22,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:22,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:22,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 23:57:22,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 23:57:22,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 23:57:22,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:22,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:22,067 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 23:57:22,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 23:57:22,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-11 23:57:22,106 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 23:57:22,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:22,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:22,124 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 23:57:22,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 23:57:22,144 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 38 treesize of output 26 [2018-04-11 23:57:22,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 23:57:22,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:22,160 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 23:57:22,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:22,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:22,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:57:22,168 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-11 23:57:22,261 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 23:57:22,261 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:22,405 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 23:57:22,425 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:22,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2018-04-11 23:57:22,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 23:57:22,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 23:57:22,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-11 23:57:22,425 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 14 states. [2018-04-11 23:57:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:23,089 INFO L93 Difference]: Finished difference Result 289 states and 310 transitions. [2018-04-11 23:57:23,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 23:57:23,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-04-11 23:57:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:23,092 INFO L225 Difference]: With dead ends: 289 [2018-04-11 23:57:23,092 INFO L226 Difference]: Without dead ends: 288 [2018-04-11 23:57:23,092 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2018-04-11 23:57:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-11 23:57:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 181. [2018-04-11 23:57:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 23:57:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 191 transitions. [2018-04-11 23:57:23,101 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 191 transitions. Word has length 30 [2018-04-11 23:57:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:23,102 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 191 transitions. [2018-04-11 23:57:23,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 23:57:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 191 transitions. [2018-04-11 23:57:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 23:57:23,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:23,103 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] [2018-04-11 23:57:23,103 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1076965013, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:23,116 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:23,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:23,144 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 23:57:23,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:23,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:23,152 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 23:57:23,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 23:57:23,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 23:57:23,167 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 23:57:23,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 23:57:23,176 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 23:57:23,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,182 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 23:57:23,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-11 23:57:23,208 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 23:57:23,210 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 23:57:23,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 48 [2018-04-11 23:57:23,235 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 23:57:23,235 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,247 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 23:57:23,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-11 23:57:23,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-11 23:57:23,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-11 23:57:23,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,294 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 23:57:23,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,308 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 24 treesize of output 22 [2018-04-11 23:57:23,311 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 23:57:23,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 23:57:23,317 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,319 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,323 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 23:57:23,323 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-11 23:57:23,345 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 23:57:23,345 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:23,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-04-11 23:57:23,677 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 9 treesize of output 8 [2018-04-11 23:57:23,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,683 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 50 treesize of output 46 [2018-04-11 23:57:23,685 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 46 treesize of output 37 [2018-04-11 23:57:23,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,695 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 23:57:23,708 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 9 treesize of output 8 [2018-04-11 23:57:23,708 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,723 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 17 [2018-04-11 23:57:23,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-04-11 23:57:23,726 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,729 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,730 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 16 treesize of output 12 [2018-04-11 23:57:23,732 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 12 treesize of output 3 [2018-04-11 23:57:23,732 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,733 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,742 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 23:57:23,790 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-11 23:57:23,805 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 9 treesize of output 8 [2018-04-11 23:57:23,805 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,821 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 17 [2018-04-11 23:57:23,823 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 6 treesize of output 1 [2018-04-11 23:57:23,823 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,827 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,829 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 20 treesize of output 16 [2018-04-11 23:57:23,831 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 23:57:23,831 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,833 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:23,844 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 23:57:23,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 23:57:23,876 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:101, output treesize:33 [2018-04-11 23:57:23,925 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 23:57:23,946 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:23,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2018-04-11 23:57:23,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 23:57:23,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 23:57:23,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-04-11 23:57:23,946 INFO L87 Difference]: Start difference. First operand 181 states and 191 transitions. Second operand 18 states. [2018-04-11 23:57:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:24,772 INFO L93 Difference]: Finished difference Result 245 states and 259 transitions. [2018-04-11 23:57:24,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 23:57:24,773 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-04-11 23:57:24,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:24,774 INFO L225 Difference]: With dead ends: 245 [2018-04-11 23:57:24,774 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 23:57:24,775 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 23:57:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 23:57:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 178. [2018-04-11 23:57:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 23:57:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 188 transitions. [2018-04-11 23:57:24,784 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 188 transitions. Word has length 30 [2018-04-11 23:57:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:24,785 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 188 transitions. [2018-04-11 23:57:24,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 23:57:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 188 transitions. [2018-04-11 23:57:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 23:57:24,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:24,787 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] [2018-04-11 23:57:24,787 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1715684552, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:24,795 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:24,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:24,827 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 23:57:24,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:24,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:24,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:57:24,839 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 23:57:24,841 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 23:57:24,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:24,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:24,857 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 23:57:24,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-11 23:57:24,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 23:57:24,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 23:57:24,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:24,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:24,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:24,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-11 23:57:24,879 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 23:57:24,879 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:24,886 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 23:57:24,915 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:24,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-11 23:57:24,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 23:57:24,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 23:57:24,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 23:57:24,915 INFO L87 Difference]: Start difference. First operand 178 states and 188 transitions. Second operand 5 states. [2018-04-11 23:57:25,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:25,128 INFO L93 Difference]: Finished difference Result 278 states and 296 transitions. [2018-04-11 23:57:25,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:57:25,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-11 23:57:25,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:25,130 INFO L225 Difference]: With dead ends: 278 [2018-04-11 23:57:25,130 INFO L226 Difference]: Without dead ends: 277 [2018-04-11 23:57:25,130 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 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 23:57:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-11 23:57:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 177. [2018-04-11 23:57:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-11 23:57:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 187 transitions. [2018-04-11 23:57:25,136 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 187 transitions. Word has length 38 [2018-04-11 23:57:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:25,137 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 187 transitions. [2018-04-11 23:57:25,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 23:57:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 187 transitions. [2018-04-11 23:57:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 23:57:25,137 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:25,137 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] [2018-04-11 23:57:25,138 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:25,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1715684551, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:25,144 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:25,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:25,166 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 23:57:25,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:57:25,176 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 23:57:25,177 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 23:57:25,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,185 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 23:57:25,187 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 23:57:25,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,192 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 23:57:25,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-04-11 23:57:25,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 23:57:25,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 23:57:25,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,208 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 23:57:25,210 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 23:57:25,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,214 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 23:57:25,214 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-04-11 23:57:25,220 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 23:57:25,220 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:25,254 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 23:57:25,273 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:25,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-11 23:57:25,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 23:57:25,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 23:57:25,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 23:57:25,274 INFO L87 Difference]: Start difference. First operand 177 states and 187 transitions. Second operand 8 states. [2018-04-11 23:57:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:25,524 INFO L93 Difference]: Finished difference Result 313 states and 332 transitions. [2018-04-11 23:57:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 23:57:25,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-04-11 23:57:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:25,526 INFO L225 Difference]: With dead ends: 313 [2018-04-11 23:57:25,526 INFO L226 Difference]: Without dead ends: 312 [2018-04-11 23:57:25,526 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-04-11 23:57:25,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-11 23:57:25,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 176. [2018-04-11 23:57:25,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 23:57:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2018-04-11 23:57:25,534 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 38 [2018-04-11 23:57:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:25,535 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2018-04-11 23:57:25,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 23:57:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2018-04-11 23:57:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 23:57:25,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:25,536 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] [2018-04-11 23:57:25,536 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash -11351577, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:25,548 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:25,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:25,576 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 23:57:25,576 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:25,580 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 23:57:25,600 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:25,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 23:57:25,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 23:57:25,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 23:57:25,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 23:57:25,600 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 3 states. [2018-04-11 23:57:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:25,703 INFO L93 Difference]: Finished difference Result 241 states and 254 transitions. [2018-04-11 23:57:25,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 23:57:25,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-04-11 23:57:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:25,704 INFO L225 Difference]: With dead ends: 241 [2018-04-11 23:57:25,704 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 23:57:25,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 23:57:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 23:57:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 176. [2018-04-11 23:57:25,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 23:57:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 185 transitions. [2018-04-11 23:57:25,715 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 185 transitions. Word has length 40 [2018-04-11 23:57:25,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:25,715 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 185 transitions. [2018-04-11 23:57:25,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 23:57:25,717 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 185 transitions. [2018-04-11 23:57:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 23:57:25,717 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:25,717 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] [2018-04-11 23:57:25,718 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:25,718 INFO L82 PathProgramCache]: Analyzing trace with hash 893584142, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:25,727 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:25,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:25,787 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 12 treesize of output 11 [2018-04-11 23:57:25,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-11 23:57:25,819 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 23:57:25,821 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 23:57:25,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-11 23:57:25,851 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 23:57:25,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:25,855 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 23:57:25,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-11 23:57:25,944 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 36 treesize of output 26 [2018-04-11 23:57:25,947 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 26 treesize of output 10 [2018-04-11 23:57:25,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:25,956 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 23:57:25,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:15 [2018-04-11 23:57:26,002 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 23:57:26,002 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:28,288 WARN L1011 $PredicateComparison]: unable to prove that (and (or (= 0 c_main_~null~0.offset) (forall ((|v_main_#t~malloc1.base_5| Int)) (= 1 (select (store |c_#valid| |v_main_#t~malloc1.base_5| 1) c_main_~null~0.base)))) (forall ((v_prenex_5 Int)) (or (= 1 (select (store |c_#valid| v_prenex_5 1) c_main_~null~0.base)) (= c_main_~null~0.base v_prenex_5)))) is different from false [2018-04-11 23:57:28,300 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 23:57:28,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:57:28,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-04-11 23:57:28,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 23:57:28,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 23:57:28,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=306, Unknown=1, NotChecked=36, Total=420 [2018-04-11 23:57:28,321 INFO L87 Difference]: Start difference. First operand 176 states and 185 transitions. Second operand 21 states. [2018-04-11 23:57:32,337 WARN L151 SmtUtils]: Spent 3972ms on a formula simplification. DAG size of input: 24 DAG size of output 11 [2018-04-11 23:57:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:33,412 INFO L93 Difference]: Finished difference Result 274 states and 291 transitions. [2018-04-11 23:57:33,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 23:57:33,412 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-04-11 23:57:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:33,413 INFO L225 Difference]: With dead ends: 274 [2018-04-11 23:57:33,414 INFO L226 Difference]: Without dead ends: 273 [2018-04-11 23:57:33,415 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=723, Invalid=1632, Unknown=1, NotChecked=94, Total=2450 [2018-04-11 23:57:33,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-11 23:57:33,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 190. [2018-04-11 23:57:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-11 23:57:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 202 transitions. [2018-04-11 23:57:33,422 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 202 transitions. Word has length 42 [2018-04-11 23:57:33,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:33,422 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 202 transitions. [2018-04-11 23:57:33,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 23:57:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 202 transitions. [2018-04-11 23:57:33,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 23:57:33,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:33,423 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] [2018-04-11 23:57:33,435 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:33,435 INFO L82 PathProgramCache]: Analyzing trace with hash 893584143, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:33,447 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:33,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:33,491 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 23:57:33,505 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 23:57:33,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,528 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 23:57:33,530 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 23:57:33,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,535 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-11 23:57:33,552 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 23:57:33,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:33,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 23:57:33,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,569 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 23:57:33,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:33,573 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 23:57:33,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 23:57:33,618 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 23:57:33,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:33,621 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 23:57:33,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,632 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 23:57:33,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:33,636 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 23:57:33,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:33,641 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 23:57:33,642 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-11 23:57:33,666 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 23:57:33,666 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:33,697 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 23:57:33,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:57:33,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-04-11 23:57:33,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 23:57:33,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 23:57:33,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 23:57:33,730 INFO L87 Difference]: Start difference. First operand 190 states and 202 transitions. Second operand 8 states. [2018-04-11 23:57:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:34,105 INFO L93 Difference]: Finished difference Result 338 states and 357 transitions. [2018-04-11 23:57:34,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 23:57:34,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-04-11 23:57:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:34,107 INFO L225 Difference]: With dead ends: 338 [2018-04-11 23:57:34,107 INFO L226 Difference]: Without dead ends: 254 [2018-04-11 23:57:34,107 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-04-11 23:57:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-11 23:57:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 189. [2018-04-11 23:57:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 23:57:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 199 transitions. [2018-04-11 23:57:34,114 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 199 transitions. Word has length 42 [2018-04-11 23:57:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:34,114 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 199 transitions. [2018-04-11 23:57:34,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 23:57:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 199 transitions. [2018-04-11 23:57:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 23:57:34,114 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:34,115 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 23:57:34,115 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1736098048, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:34,122 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:34,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:34,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:34,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:34,183 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 23:57:34,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 23:57:34,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 23:57:34,199 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 23:57:34,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,205 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 23:57:34,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 23:57:34,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-11 23:57:34,242 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 23:57:34,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,253 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 23:57:34,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-11 23:57:34,269 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 38 treesize of output 26 [2018-04-11 23:57:34,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 23:57:34,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,277 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 23:57:34,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:57:34,285 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-11 23:57:34,309 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 23:57:34,309 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:34,361 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 23:57:34,382 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:34,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2018-04-11 23:57:34,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 23:57:34,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 23:57:34,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-04-11 23:57:34,383 INFO L87 Difference]: Start difference. First operand 189 states and 199 transitions. Second operand 13 states. [2018-04-11 23:57:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:34,853 INFO L93 Difference]: Finished difference Result 317 states and 335 transitions. [2018-04-11 23:57:34,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 23:57:34,854 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-04-11 23:57:34,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:34,855 INFO L225 Difference]: With dead ends: 317 [2018-04-11 23:57:34,856 INFO L226 Difference]: Without dead ends: 316 [2018-04-11 23:57:34,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2018-04-11 23:57:34,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-11 23:57:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 188. [2018-04-11 23:57:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 23:57:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 198 transitions. [2018-04-11 23:57:34,867 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 198 transitions. Word has length 43 [2018-04-11 23:57:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:34,867 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 198 transitions. [2018-04-11 23:57:34,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 23:57:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 198 transitions. [2018-04-11 23:57:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 23:57:34,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:34,868 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 23:57:34,869 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1736098047, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:34,885 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:34,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:34,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:34,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:34,928 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 23:57:34,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:57:34,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 23:57:34,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 23:57:34,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 23:57:34,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:34,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 23:57:34,998 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 23:57:34,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-11 23:57:35,031 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 23:57:35,033 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 23:57:35,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 48 [2018-04-11 23:57:35,052 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 23:57:35,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,065 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 23:57:35,065 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-11 23:57:35,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-11 23:57:35,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 23:57:35,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-11 23:57:35,108 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,121 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 24 treesize of output 22 [2018-04-11 23:57:35,123 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 23:57:35,123 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,128 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 23:57:35,128 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,129 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,133 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 23:57:35,133 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-11 23:57:35,152 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 23:57:35,152 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:35,268 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-04-11 23:57:35,292 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 9 treesize of output 8 [2018-04-11 23:57:35,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,298 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 50 treesize of output 46 [2018-04-11 23:57:35,300 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 46 treesize of output 37 [2018-04-11 23:57:35,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,312 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 23:57:35,327 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 9 treesize of output 8 [2018-04-11 23:57:35,328 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,341 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 17 [2018-04-11 23:57:35,343 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 6 treesize of output 1 [2018-04-11 23:57:35,343 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,347 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,348 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 16 treesize of output 12 [2018-04-11 23:57:35,365 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 12 treesize of output 3 [2018-04-11 23:57:35,365 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,381 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,467 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 23:57:35,507 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-11 23:57:35,531 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 9 treesize of output 8 [2018-04-11 23:57:35,532 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,547 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 17 [2018-04-11 23:57:35,549 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 6 treesize of output 1 [2018-04-11 23:57:35,549 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,553 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,554 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 20 treesize of output 16 [2018-04-11 23:57:35,556 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 23:57:35,556 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,558 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:35,568 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 23:57:35,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 23:57:35,592 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 7 variables, input treesize:101, output treesize:33 [2018-04-11 23:57:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:57:35,679 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:35,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2018-04-11 23:57:35,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 23:57:35,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 23:57:35,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-11 23:57:35,680 INFO L87 Difference]: Start difference. First operand 188 states and 198 transitions. Second operand 16 states. [2018-04-11 23:57:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:36,305 INFO L93 Difference]: Finished difference Result 238 states and 250 transitions. [2018-04-11 23:57:36,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 23:57:36,305 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-11 23:57:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:36,306 INFO L225 Difference]: With dead ends: 238 [2018-04-11 23:57:36,307 INFO L226 Difference]: Without dead ends: 236 [2018-04-11 23:57:36,307 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-04-11 23:57:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-04-11 23:57:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 186. [2018-04-11 23:57:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-11 23:57:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 196 transitions. [2018-04-11 23:57:36,313 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 196 transitions. Word has length 43 [2018-04-11 23:57:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:36,313 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 196 transitions. [2018-04-11 23:57:36,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 23:57:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 196 transitions. [2018-04-11 23:57:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 23:57:36,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:36,314 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] [2018-04-11 23:57:36,314 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:36,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1286059621, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:36,320 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:36,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:36,344 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 23:57:36,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 23:57:36,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-11 23:57:36,353 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 23:57:36,354 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:36,367 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 23:57:36,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:1 [2018-04-11 23:57:36,370 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 23:57:36,390 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:36,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-11 23:57:36,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:57:36,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:57:36,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:57:36,391 INFO L87 Difference]: Start difference. First operand 186 states and 196 transitions. Second operand 6 states. [2018-04-11 23:57:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:36,488 INFO L93 Difference]: Finished difference Result 278 states and 293 transitions. [2018-04-11 23:57:36,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 23:57:36,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-04-11 23:57:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:36,489 INFO L225 Difference]: With dead ends: 278 [2018-04-11 23:57:36,489 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 23:57:36,489 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-11 23:57:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 23:57:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 184. [2018-04-11 23:57:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 23:57:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 192 transitions. [2018-04-11 23:57:36,494 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 192 transitions. Word has length 44 [2018-04-11 23:57:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:36,494 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 192 transitions. [2018-04-11 23:57:36,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:57:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 192 transitions. [2018-04-11 23:57:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 23:57:36,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:36,495 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] [2018-04-11 23:57:36,495 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:36,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1817729817, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:36,501 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:36,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:36,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:36,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:36,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, 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 23:57:36,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 23:57:36,531 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 23:57:36,531 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:36,545 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 23:57:36,564 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:36,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2018-04-11 23:57:36,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:57:36,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:57:36,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:57:36,565 INFO L87 Difference]: Start difference. First operand 184 states and 192 transitions. Second operand 6 states. [2018-04-11 23:57:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:36,668 INFO L93 Difference]: Finished difference Result 230 states and 239 transitions. [2018-04-11 23:57:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 23:57:36,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-04-11 23:57:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:36,669 INFO L225 Difference]: With dead ends: 230 [2018-04-11 23:57:36,669 INFO L226 Difference]: Without dead ends: 223 [2018-04-11 23:57:36,670 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 23:57:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-04-11 23:57:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 189. [2018-04-11 23:57:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 23:57:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 197 transitions. [2018-04-11 23:57:36,675 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 197 transitions. Word has length 48 [2018-04-11 23:57:36,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:36,675 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 197 transitions. [2018-04-11 23:57:36,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:57:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 197 transitions. [2018-04-11 23:57:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 23:57:36,675 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:36,675 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] [2018-04-11 23:57:36,676 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:36,676 INFO L82 PathProgramCache]: Analyzing trace with hash -759384295, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:36,681 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:36,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:36,701 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 23:57:36,702 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 23:57:36,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-04-11 23:57:36,708 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 23:57:36,710 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 23:57:36,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-04-11 23:57:36,717 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 23:57:36,717 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:36,732 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 23:57:36,753 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:57:36,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-11 23:57:36,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:57:36,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:57:36,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:57:36,754 INFO L87 Difference]: Start difference. First operand 189 states and 197 transitions. Second operand 6 states. [2018-04-11 23:57:36,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:36,829 INFO L93 Difference]: Finished difference Result 323 states and 337 transitions. [2018-04-11 23:57:36,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:57:36,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-04-11 23:57:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:36,831 INFO L225 Difference]: With dead ends: 323 [2018-04-11 23:57:36,831 INFO L226 Difference]: Without dead ends: 277 [2018-04-11 23:57:36,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 23:57:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-11 23:57:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 260. [2018-04-11 23:57:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-11 23:57:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 279 transitions. [2018-04-11 23:57:36,844 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 279 transitions. Word has length 53 [2018-04-11 23:57:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:36,844 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 279 transitions. [2018-04-11 23:57:36,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:57:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 279 transitions. [2018-04-11 23:57:36,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 23:57:36,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:36,845 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] [2018-04-11 23:57:36,846 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:36,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1270647918, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:36,858 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:36,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:36,893 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 23:57:36,895 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 23:57:36,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,906 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 23:57:36,908 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 23:57:36,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:36,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-11 23:57:36,998 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 23:57:37,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:37,002 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 23:57:37,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:37,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:37,015 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 23:57:37,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:37,018 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 23:57:37,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:37,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:37,025 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 23:57:37,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-04-11 23:57:37,055 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 23:57:37,055 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:37,135 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 23:57:37,166 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:57:37,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-04-11 23:57:37,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 23:57:37,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 23:57:37,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-11 23:57:37,167 INFO L87 Difference]: Start difference. First operand 260 states and 279 transitions. Second operand 14 states. [2018-04-11 23:57:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:37,731 INFO L93 Difference]: Finished difference Result 385 states and 409 transitions. [2018-04-11 23:57:37,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 23:57:37,731 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2018-04-11 23:57:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:37,733 INFO L225 Difference]: With dead ends: 385 [2018-04-11 23:57:37,733 INFO L226 Difference]: Without dead ends: 344 [2018-04-11 23:57:37,733 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-04-11 23:57:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-11 23:57:37,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 286. [2018-04-11 23:57:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-11 23:57:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 308 transitions. [2018-04-11 23:57:37,746 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 308 transitions. Word has length 56 [2018-04-11 23:57:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:37,746 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 308 transitions. [2018-04-11 23:57:37,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 23:57:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 308 transitions. [2018-04-11 23:57:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 23:57:37,747 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:37,748 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] [2018-04-11 23:57:37,748 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash -538502597, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:37,762 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:37,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:37,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:37,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-11 23:57:37,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:37,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:37,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:37,880 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 23:57:37,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:37,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:37,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 23:57:37,900 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 23:57:37,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 23:57:37,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:37,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:37,911 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 23:57:37,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:33 [2018-04-11 23:57:37,943 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 18 treesize of output 14 [2018-04-11 23:57:37,945 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 14 treesize of output 10 [2018-04-11 23:57:37,945 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 23:57:37,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:57:37,954 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 23:57:37,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-11 23:57:38,021 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 23:57:38,022 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:38,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 23:57:38,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:38,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:38,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:6 [2018-04-11 23:57:38,136 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 23:57:38,155 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:57:38,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-04-11 23:57:38,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 23:57:38,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 23:57:38,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-04-11 23:57:38,156 INFO L87 Difference]: Start difference. First operand 286 states and 308 transitions. Second operand 13 states. [2018-04-11 23:57:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:38,564 INFO L93 Difference]: Finished difference Result 312 states and 334 transitions. [2018-04-11 23:57:38,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 23:57:38,565 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-04-11 23:57:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:38,566 INFO L225 Difference]: With dead ends: 312 [2018-04-11 23:57:38,566 INFO L226 Difference]: Without dead ends: 311 [2018-04-11 23:57:38,567 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2018-04-11 23:57:38,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-04-11 23:57:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 285. [2018-04-11 23:57:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-11 23:57:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 306 transitions. [2018-04-11 23:57:38,581 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 306 transitions. Word has length 58 [2018-04-11 23:57:38,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:38,582 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 306 transitions. [2018-04-11 23:57:38,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 23:57:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 306 transitions. [2018-04-11 23:57:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 23:57:38,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:38,583 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] [2018-04-11 23:57:38,583 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:38,583 INFO L82 PathProgramCache]: Analyzing trace with hash -934027680, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:38,595 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:38,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:38,854 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 23:57:38,854 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:39,039 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 23:57:39,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:57:39,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-11 23:57:39,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 23:57:39,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 23:57:39,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=217, Unknown=8, NotChecked=0, Total=272 [2018-04-11 23:57:39,060 INFO L87 Difference]: Start difference. First operand 285 states and 306 transitions. Second operand 17 states. [2018-04-11 23:57:39,449 WARN L1011 $PredicateComparison]: unable to prove that (and (or (= 0 c_main_~null~0.offset) (forall ((v_prenex_10 Int)) (or (not (= (select |c_#valid| v_prenex_10) 0)) (= (store (store |c_#valid| v_prenex_10 0) c_main_~null~0.base 0) |c_old(#valid)|)))) (forall ((|v_main_#t~malloc1.base_7| Int)) (or (= (store (store |c_#valid| |v_main_#t~malloc1.base_7| 0) c_main_~null~0.base 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc1.base_7|) 0)) (= c_main_~null~0.base |v_main_#t~malloc1.base_7|))) (= (store (store |c_#valid| c_main_~list~0.base 0) c_main_~null~0.base 0) |c_old(#valid)|) (or (= (store (store |c_#valid| |c_main_#t~malloc1.base| 0) c_main_~null~0.base 0) |c_old(#valid)|) (and (= |c_main_#t~malloc1.base| c_main_~null~0.base) (= |c_main_#t~malloc1.offset| c_main_~null~0.offset))) (exists ((main_~null~0.base Int) (main_~list~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~null~0.base 1))) (and (= (store (store .cse0 main_~list~0.base 0) main_~null~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~null~0.base) 0) (= (select .cse0 main_~list~0.base) 0))))) is different from false [2018-04-11 23:57:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:39,562 INFO L93 Difference]: Finished difference Result 307 states and 327 transitions. [2018-04-11 23:57:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 23:57:39,562 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-04-11 23:57:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:39,563 INFO L225 Difference]: With dead ends: 307 [2018-04-11 23:57:39,563 INFO L226 Difference]: Without dead ends: 266 [2018-04-11 23:57:39,564 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=334, Unknown=9, NotChecked=38, Total=462 [2018-04-11 23:57:39,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-11 23:57:39,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-04-11 23:57:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-11 23:57:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 284 transitions. [2018-04-11 23:57:39,573 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 284 transitions. Word has length 60 [2018-04-11 23:57:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:39,573 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 284 transitions. [2018-04-11 23:57:39,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 23:57:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 284 transitions. [2018-04-11 23:57:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 23:57:39,574 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:39,574 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] [2018-04-11 23:57:39,574 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:39,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1698069980, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:39,585 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:39,616 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:39,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:39,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:39,627 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 23:57:39,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:39,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:39,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 23:57:39,643 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 23:57:39,645 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 23:57:39,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:39,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:39,654 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 23:57:39,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-11 23:57:39,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:39,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-11 23:57:39,695 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 23:57:39,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:39,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:39,712 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 23:57:39,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-11 23:57:39,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-11 23:57:39,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 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 23:57:39,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 23:57:39,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 23:57:39,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 23:57:39,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:50 [2018-04-11 23:57:39,863 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 25 treesize of output 19 [2018-04-11 23:57:39,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 23:57:39,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:39,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:39,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:39,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-04-11 23:57:39,915 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 23:57:39,915 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:39,946 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 24 treesize of output 19 [2018-04-11 23:57:39,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:39,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 23:57:39,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:15 [2018-04-11 23:57:42,110 WARN L148 SmtUtils]: Spent 2009ms on a formula simplification that was a NOOP. DAG size: 23 [2018-04-11 23:57:42,902 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-04-11 23:57:42,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 23:57:42,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:42,927 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 16 treesize of output 20 [2018-04-11 23:57:42,929 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 9 [2018-04-11 23:57:42,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-04-11 23:57:42,936 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:42,941 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 12 treesize of output 7 [2018-04-11 23:57:42,942 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:42,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 23:57:42,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-11 23:57:42,946 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 6 treesize of output 1 [2018-04-11 23:57:42,946 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:42,949 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:42,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-11 23:57:42,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 23:57:42,973 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-04-11 23:57:43,024 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 23:57:43,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:57:43,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-04-11 23:57:43,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 23:57:43,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 23:57:43,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-04-11 23:57:43,044 INFO L87 Difference]: Start difference. First operand 264 states and 284 transitions. Second operand 22 states. [2018-04-11 23:57:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:44,350 INFO L93 Difference]: Finished difference Result 389 states and 414 transitions. [2018-04-11 23:57:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 23:57:44,350 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-04-11 23:57:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:44,351 INFO L225 Difference]: With dead ends: 389 [2018-04-11 23:57:44,352 INFO L226 Difference]: Without dead ends: 388 [2018-04-11 23:57:44,352 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 23:57:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-11 23:57:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 316. [2018-04-11 23:57:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-04-11 23:57:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 340 transitions. [2018-04-11 23:57:44,369 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 340 transitions. Word has length 72 [2018-04-11 23:57:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:44,369 INFO L459 AbstractCegarLoop]: Abstraction has 316 states and 340 transitions. [2018-04-11 23:57:44,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 23:57:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 340 transitions. [2018-04-11 23:57:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 23:57:44,370 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:44,371 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] [2018-04-11 23:57:44,371 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1698069979, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:44,381 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:44,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:44,482 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 43 [2018-04-11 23:57:44,486 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 28 treesize of output 31 [2018-04-11 23:57:44,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,540 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 34 treesize of output 44 [2018-04-11 23:57:44,550 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 30 treesize of output 41 [2018-04-11 23:57:44,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 23:57:44,575 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 31 treesize of output 34 [2018-04-11 23:57:44,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 23:57:44,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 23:57:44,606 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:46, output treesize:89 [2018-04-11 23:57:44,720 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 70 treesize of output 66 [2018-04-11 23:57:44,722 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 62 treesize of output 53 [2018-04-11 23:57:44,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,748 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 58 treesize of output 52 [2018-04-11 23:57:44,748 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 23:57:44,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-04-11 23:57:44,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 23:57:44,865 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 48 treesize of output 44 [2018-04-11 23:57:44,868 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 40 treesize of output 27 [2018-04-11 23:57:44,869 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:44,895 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 36 treesize of output 22 [2018-04-11 23:57:44,896 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,912 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,914 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 44 treesize of output 34 [2018-04-11 23:57:44,916 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 23:57:44,916 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 23:57:44,923 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,927 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,932 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 43 treesize of output 41 [2018-04-11 23:57:44,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-04-11 23:57:44,934 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,953 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 33 treesize of output 17 [2018-04-11 23:57:44,953 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,966 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:44,998 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 47 treesize of output 39 [2018-04-11 23:57:45,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-04-11 23:57:45,003 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,009 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-04-11 23:57:45,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 23:57:45,037 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,042 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-11 23:57:45,065 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:118, output treesize:67 [2018-04-11 23:57:45,180 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 23:57:45,180 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:45,265 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-04-11 23:57:45,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 23:57:45,284 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-04-11 23:57:45,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 23:57:45,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-04-11 23:57:45,313 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-04-11 23:57:45,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-04-11 23:57:45,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:99 [2018-04-11 23:57:45,578 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 1 case distinctions, treesize of input 33 treesize of output 33 [2018-04-11 23:57:45,580 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-04-11 23:57:45,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-04-11 23:57:45,591 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-04-11 23:57:45,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 23:57:45,610 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 33 treesize of output 35 [2018-04-11 23:57:45,611 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 30 treesize of output 28 [2018-04-11 23:57:45,611 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,625 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-04-11 23:57:45,625 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,636 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 23 treesize of output 21 [2018-04-11 23:57:45,636 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,645 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 23:57:45,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-04-11 23:57:45,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 23:57:45,686 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,687 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,688 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 11 treesize of output 9 [2018-04-11 23:57:45,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 23:57:45,689 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,690 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:45,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 23:57:45,712 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:199, output treesize:7 [2018-04-11 23:57:45,743 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 23:57:45,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:57:45,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2018-04-11 23:57:45,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 23:57:45,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 23:57:45,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-04-11 23:57:45,763 INFO L87 Difference]: Start difference. First operand 316 states and 340 transitions. Second operand 24 states. [2018-04-11 23:57:47,774 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 83 DAG size of output 67 [2018-04-11 23:57:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:57:48,201 INFO L93 Difference]: Finished difference Result 418 states and 445 transitions. [2018-04-11 23:57:48,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 23:57:48,202 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2018-04-11 23:57:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:57:48,203 INFO L225 Difference]: With dead ends: 418 [2018-04-11 23:57:48,203 INFO L226 Difference]: Without dead ends: 415 [2018-04-11 23:57:48,204 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=644, Invalid=2662, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 23:57:48,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-04-11 23:57:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 321. [2018-04-11 23:57:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-04-11 23:57:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 345 transitions. [2018-04-11 23:57:48,216 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 345 transitions. Word has length 72 [2018-04-11 23:57:48,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:57:48,216 INFO L459 AbstractCegarLoop]: Abstraction has 321 states and 345 transitions. [2018-04-11 23:57:48,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 23:57:48,216 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 345 transitions. [2018-04-11 23:57:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-04-11 23:57:48,217 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:57:48,217 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2018-04-11 23:57:48,217 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr66AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr68EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr61AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr67AssertViolationMEMORY_FREE, mainErr40RequiresViolation]=== [2018-04-11 23:57:48,217 INFO L82 PathProgramCache]: Analyzing trace with hash 944121636, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:57:48,225 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:57:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:57:48,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:57:48,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:48,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:48,274 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 23:57:48,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 23:57:48,284 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 23:57:48,285 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 23:57:48,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,290 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 23:57:48,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-11 23:57:48,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:57:48,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2018-04-11 23:57:48,310 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 23:57:48,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,318 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 23:57:48,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-04-11 23:57:48,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-04-11 23:57:48,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 39 [2018-04-11 23:57:48,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 23:57:48,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 23:57:48,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-11 23:57:48,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 23:57:48,396 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-04-11 23:57:48,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 23:57:48,406 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,411 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,424 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 23:57:48,424 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:68, output treesize:92 [2018-04-11 23:57:48,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-04-11 23:57:48,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 23:57:48,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-04-11 23:57:48,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:57:48,516 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 23:57:48,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 23:57:48,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 23:57:48,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,526 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:57:48,529 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2018-04-11 23:57:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:57:48,571 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:57:58,903 WARN L148 SmtUtils]: Spent 6052ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-11 23:58:05,382 WARN L148 SmtUtils]: Spent 4137ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-11 23:58:05,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 109 [2018-04-11 23:58:05,464 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 91 treesize of output 90 [2018-04-11 23:58:05,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:05,495 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 100 [2018-04-11 23:58:05,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 23:58:05,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 114 [2018-04-11 23:58:05,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 79 [2018-04-11 23:58:05,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:05,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 75 [2018-04-11 23:58:05,842 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:58:06,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104 [2018-04-11 23:58:06,068 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:58:06,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2018-04-11 23:58:06,291 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:58:06,503 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 83 [2018-04-11 23:58:06,504 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:06,693 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:58:06,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-11 23:58:06,713 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:06,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-04-11 23:58:06,957 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:58:07,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 74 [2018-04-11 23:58:07,239 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 23:58:07,776 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:58:07,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 87 [2018-04-11 23:58:07,796 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:08,549 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 62 treesize of output 54 [2018-04-11 23:58:08,550 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:08,922 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2018-04-11 23:58:08,923 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 23:58:09,329 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 76 [2018-04-11 23:58:09,332 INFO L267 ElimStorePlain]: Start of recursive call 17: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-04-11 23:58:09,904 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 41 [2018-04-11 23:58:09,905 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:09,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2018-04-11 23:58:09,911 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-11 23:58:10,437 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 84 treesize of output 76 [2018-04-11 23:58:10,438 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:10,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 64 [2018-04-11 23:58:10,985 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 23:58:11,506 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 78 [2018-04-11 23:58:11,507 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 23:58:12,105 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 56 treesize of output 54 [2018-04-11 23:58:12,106 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:12,706 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 102 [2018-04-11 23:58:12,710 INFO L267 ElimStorePlain]: Start of recursive call 24: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-04-11 23:58:13,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-04-11 23:58:13,434 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:13,436 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 54 treesize of output 48 [2018-04-11 23:58:13,436 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:14,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:58:14,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 107 [2018-04-11 23:58:14,045 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:14,736 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 66 treesize of output 64 [2018-04-11 23:58:14,737 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:14,738 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 69 treesize of output 67 [2018-04-11 23:58:14,738 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:15,405 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:58:15,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 107 [2018-04-11 23:58:15,425 INFO L267 ElimStorePlain]: Start of recursive call 30: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:16,369 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 95 [2018-04-11 23:58:16,370 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-04-11 23:58:17,378 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 59 treesize of output 51 [2018-04-11 23:58:17,378 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:18,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-04-11 23:58:18,571 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:19,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-04-11 23:58:19,590 INFO L267 ElimStorePlain]: Start of recursive call 34: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-04-11 23:58:20,885 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 70 treesize of output 68 [2018-04-11 23:58:20,885 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:20,919 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 70 treesize of output 68 [2018-04-11 23:58:20,919 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:22,769 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 73 [2018-04-11 23:58:22,772 INFO L267 ElimStorePlain]: Start of recursive call 37: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-04-11 23:58:23,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 61 [2018-04-11 23:58:23,639 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:58:23,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-04-11 23:58:23,640 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:58:25,084 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 72 treesize of output 70 [2018-04-11 23:58:25,085 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:25,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-04-11 23:58:25,087 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:25,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2018-04-11 23:58:25,089 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:25,090 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 69 treesize of output 67 [2018-04-11 23:58:25,090 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:25,785 INFO L267 ElimStorePlain]: Start of recursive call 5: 34 dim-1 vars, End of recursive call: 26 dim-0 vars, and 28 xjuncts. [2018-04-11 23:58:26,717 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 2 case distinctions, treesize of input 79 treesize of output 89 [2018-04-11 23:58:26,720 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 79 treesize of output 75 [2018-04-11 23:58:26,720 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:26,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-04-11 23:58:26,751 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:26,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2018-04-11 23:58:26,785 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 23:58:26,822 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 56 treesize of output 50 [2018-04-11 23:58:26,822 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:26,859 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 64 treesize of output 62 [2018-04-11 23:58:26,859 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:26,860 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 67 treesize of output 65 [2018-04-11 23:58:26,860 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:26,901 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 51 [2018-04-11 23:58:26,902 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:26,911 INFO L267 ElimStorePlain]: Start of recursive call 44: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:58:26,924 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 99 [2018-04-11 23:58:26,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2018-04-11 23:58:26,927 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:58:26,966 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 62 [2018-04-11 23:58:26,966 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 23:58:27,000 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 78 treesize of output 74 [2018-04-11 23:58:27,000 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:27,030 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 83 treesize of output 81 [2018-04-11 23:58:27,030 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:27,063 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2018-04-11 23:58:27,064 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 23:58:27,092 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:58:27,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 85 [2018-04-11 23:58:27,111 INFO L267 ElimStorePlain]: Start of recursive call 58: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:27,178 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 51 [2018-04-11 23:58:27,179 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:27,274 INFO L267 ElimStorePlain]: Start of recursive call 52: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-04-11 23:58:28,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 120 [2018-04-11 23:58:29,869 WARN L151 SmtUtils]: Spent 1201ms on a formula simplification. DAG size of input: 491 DAG size of output 489 [2018-04-11 23:58:29,872 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:58:29,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 107 [2018-04-11 23:58:29,891 INFO L267 ElimStorePlain]: Start of recursive call 61: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:30,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:58:30,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 100 [2018-04-11 23:58:30,679 INFO L267 ElimStorePlain]: Start of recursive call 62: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:31,515 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 105 treesize of output 101 [2018-04-11 23:58:31,516 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:32,340 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 95 treesize of output 91 [2018-04-11 23:58:32,341 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:33,167 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 101 treesize of output 99 [2018-04-11 23:58:33,168 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:33,169 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 102 treesize of output 98 [2018-04-11 23:58:33,169 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:34,087 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 98 [2018-04-11 23:58:34,103 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 87 [2018-04-11 23:58:34,104 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-04-11 23:58:34,137 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:58:34,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 80 treesize of output 110 [2018-04-11 23:58:34,161 INFO L267 ElimStorePlain]: Start of recursive call 69: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:34,220 INFO L267 ElimStorePlain]: Start of recursive call 67: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 23:58:35,431 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2018-04-11 23:58:35,432 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 23:58:36,815 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 85 [2018-04-11 23:58:36,816 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:38,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 100 [2018-04-11 23:58:38,175 INFO L267 ElimStorePlain]: Start of recursive call 72: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:39,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 110 [2018-04-11 23:58:39,882 INFO L267 ElimStorePlain]: Start of recursive call 73: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-04-11 23:58:41,993 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:58:42,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 107 [2018-04-11 23:58:42,014 INFO L267 ElimStorePlain]: Start of recursive call 74: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:43,855 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 85 treesize of output 83 [2018-04-11 23:58:43,856 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:43,858 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 85 treesize of output 83 [2018-04-11 23:58:43,859 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-11 23:58:47,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 103 [2018-04-11 23:58:47,542 INFO L267 ElimStorePlain]: Start of recursive call 77: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:49,726 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 76 [2018-04-11 23:58:49,728 INFO L267 ElimStorePlain]: Start of recursive call 78: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-04-11 23:58:52,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-04-11 23:58:52,743 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-04-11 23:58:52,756 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 88 [2018-04-11 23:58:52,760 INFO L267 ElimStorePlain]: Start of recursive call 80: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-04-11 23:58:56,665 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:58:56,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 87 [2018-04-11 23:58:56,687 INFO L267 ElimStorePlain]: Start of recursive call 81: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:00,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-11 23:59:00,631 INFO L267 ElimStorePlain]: Start of recursive call 82: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:02,572 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 70 [2018-04-11 23:59:02,573 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 23:59:05,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-04-11 23:59:05,122 INFO L267 ElimStorePlain]: Start of recursive call 84: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-04-11 23:59:06,352 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 63 treesize of output 61 [2018-04-11 23:59:06,352 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:08,812 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 88 [2018-04-11 23:59:08,813 INFO L267 ElimStorePlain]: Start of recursive call 86: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 23:59:10,047 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:59:10,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 77 [2018-04-11 23:59:10,066 INFO L267 ElimStorePlain]: Start of recursive call 87: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:16,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2018-04-11 23:59:16,807 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:59:21,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 80 [2018-04-11 23:59:21,950 INFO L267 ElimStorePlain]: Start of recursive call 89: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:25,361 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 63 treesize of output 61 [2018-04-11 23:59:25,362 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:25,363 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 63 treesize of output 61 [2018-04-11 23:59:25,363 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:29,759 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 66 [2018-04-11 23:59:29,762 INFO L267 ElimStorePlain]: Start of recursive call 92: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2018-04-11 23:59:31,639 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:59:31,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-11 23:59:31,660 INFO L267 ElimStorePlain]: Start of recursive call 93: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:35,369 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:59:35,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-11 23:59:35,392 INFO L267 ElimStorePlain]: Start of recursive call 94: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:36,394 INFO L267 ElimStorePlain]: Start of recursive call 60: 46 dim-1 vars, End of recursive call: 31 dim-0 vars, and 36 xjuncts. [2018-04-11 23:59:39,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 45 dim-0 vars, and 50 xjuncts. [2018-04-11 23:59:39,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 87 treesize of output 114 [2018-04-11 23:59:39,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 101 [2018-04-11 23:59:39,817 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:39,952 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 77 treesize of output 93 [2018-04-11 23:59:39,952 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:40,087 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 107 [2018-04-11 23:59:40,088 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 2 xjuncts. [2018-04-11 23:59:40,249 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 92 [2018-04-11 23:59:40,249 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 2 xjuncts. [2018-04-11 23:59:40,394 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 64 treesize of output 62 [2018-04-11 23:59:40,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-04-11 23:59:40,415 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:40,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2018-04-11 23:59:40,429 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:40,451 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 63 [2018-04-11 23:59:40,452 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 2 xjuncts. [2018-04-11 23:59:40,466 INFO L267 ElimStorePlain]: Start of recursive call 100: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 23:59:40,472 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 80 treesize of output 66 [2018-04-11 23:59:40,483 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 74 [2018-04-11 23:59:40,484 INFO L267 ElimStorePlain]: Start of recursive call 105: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 23:59:40,517 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:59:40,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 86 [2018-04-11 23:59:40,537 INFO L267 ElimStorePlain]: Start of recursive call 106: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:40,619 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 57 treesize of output 53 [2018-04-11 23:59:40,620 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:40,621 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 54 treesize of output 50 [2018-04-11 23:59:40,621 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:40,674 INFO L267 ElimStorePlain]: Start of recursive call 104: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-11 23:59:40,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 99 [2018-04-11 23:59:40,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-04-11 23:59:40,938 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,011 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 58 [2018-04-11 23:59:41,012 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 2 xjuncts. [2018-04-11 23:59:41,066 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 78 treesize of output 74 [2018-04-11 23:59:41,067 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:59:41,180 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 61 treesize of output 55 [2018-04-11 23:59:41,180 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,290 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-04-11 23:59:41,291 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 2 xjuncts. [2018-04-11 23:59:41,332 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 58 [2018-04-11 23:59:41,333 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-04-11 23:59:41,353 INFO L267 ElimStorePlain]: Start of recursive call 116: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:59:41,370 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 27 treesize of output 22 [2018-04-11 23:59:41,370 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,425 INFO L267 ElimStorePlain]: Start of recursive call 109: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 23:59:41,436 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 106 [2018-04-11 23:59:41,439 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 92 treesize of output 88 [2018-04-11 23:59:41,439 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,484 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 90 [2018-04-11 23:59:41,486 INFO L267 ElimStorePlain]: Start of recursive call 120: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 23:59:41,551 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 73 treesize of output 71 [2018-04-11 23:59:41,551 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,553 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 76 treesize of output 74 [2018-04-11 23:59:41,553 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,554 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 73 treesize of output 71 [2018-04-11 23:59:41,555 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,618 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 67 [2018-04-11 23:59:41,619 INFO L267 ElimStorePlain]: Start of recursive call 124: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 23:59:41,696 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 83 [2018-04-11 23:59:41,697 INFO L267 ElimStorePlain]: Start of recursive call 125: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 23:59:41,775 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 71 treesize of output 69 [2018-04-11 23:59:41,776 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,777 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 74 treesize of output 72 [2018-04-11 23:59:41,777 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 85 [2018-04-11 23:59:41,866 INFO L267 ElimStorePlain]: Start of recursive call 128: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:41,970 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 64 [2018-04-11 23:59:41,970 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:41,975 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 61 [2018-04-11 23:59:41,975 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:42,042 INFO L267 ElimStorePlain]: Start of recursive call 118: 8 dim-1 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-04-11 23:59:42,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 127 [2018-04-11 23:59:44,293 WARN L151 SmtUtils]: Spent 2093ms on a formula simplification. DAG size of input: 581 DAG size of output 518 [2018-04-11 23:59:44,295 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 86 treesize of output 82 [2018-04-11 23:59:44,296 INFO L267 ElimStorePlain]: Start of recursive call 132: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:59:45,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 107 [2018-04-11 23:59:45,077 INFO L267 ElimStorePlain]: Start of recursive call 133: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-04-11 23:59:46,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 86 [2018-04-11 23:59:46,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 100 [2018-04-11 23:59:46,191 INFO L267 ElimStorePlain]: Start of recursive call 135: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:46,237 INFO L267 ElimStorePlain]: Start of recursive call 134: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:47,579 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:59:47,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 87 [2018-04-11 23:59:47,597 INFO L267 ElimStorePlain]: Start of recursive call 136: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:49,045 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 93 [2018-04-11 23:59:49,046 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:50,353 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 82 [2018-04-11 23:59:50,354 INFO L267 ElimStorePlain]: Start of recursive call 138: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 23:59:51,779 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:59:51,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 103 [2018-04-11 23:59:51,799 INFO L267 ElimStorePlain]: Start of recursive call 139: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:53,324 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 92 [2018-04-11 23:59:53,325 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-04-11 23:59:54,868 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:59:54,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 107 [2018-04-11 23:59:54,886 INFO L267 ElimStorePlain]: Start of recursive call 141: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-11 23:59:56,470 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 73 [2018-04-11 23:59:56,471 INFO L267 ElimStorePlain]: Start of recursive call 142: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 23:59:57,966 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 64 [2018-04-11 23:59:57,968 INFO L267 ElimStorePlain]: Start of recursive call 143: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 23:59:59,157 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:59:59,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 77 [2018-04-11 23:59:59,176 INFO L267 ElimStorePlain]: Start of recursive call 144: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:00:00,256 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:00:00,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-12 00:00:00,275 INFO L267 ElimStorePlain]: Start of recursive call 145: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:00:07,296 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:00:07,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 80 [2018-04-12 00:00:07,322 INFO L267 ElimStorePlain]: Start of recursive call 146: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:00:09,106 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:00:09,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 77 [2018-04-12 00:00:09,126 INFO L267 ElimStorePlain]: Start of recursive call 147: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:00:11,092 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 [2018-04-12 00:00:11,093 INFO L267 ElimStorePlain]: Start of recursive call 148: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-12 00:00:11,094 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 78 treesize of output 66 [2018-04-12 00:00:11,095 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-04-12 00:00:13,800 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:00:13,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 80 [2018-04-12 00:00:13,819 INFO L267 ElimStorePlain]: Start of recursive call 150: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:00:20,615 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 68 treesize of output 66 [2018-04-12 00:00:20,616 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-04-12 00:00:20,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 64 [2018-04-12 00:00:20,618 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-04-12 00:00:36,438 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 84 treesize of output 80 [2018-04-12 00:00:36,439 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-04-12 00:00:49,019 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 84 [2018-04-12 00:00:49,020 INFO L267 ElimStorePlain]: Start of recursive call 154: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 00:00:53,075 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:00:53,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 100 [2018-04-12 00:00:53,095 INFO L267 ElimStorePlain]: Start of recursive call 155: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:00:58,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 49 [2018-04-12 00:00:58,002 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 2 xjuncts. [2018-04-12 00:00:58,013 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 63 [2018-04-12 00:00:58,014 INFO L267 ElimStorePlain]: Start of recursive call 157: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 00:00:59,556 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 85 [2018-04-12 00:00:59,557 INFO L267 ElimStorePlain]: Start of recursive call 158: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-12 00:01:00,835 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 68 treesize of output 66 [2018-04-12 00:01:00,836 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:00,837 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 71 treesize of output 69 [2018-04-12 00:01:00,838 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:02,084 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 82 [2018-04-12 00:01:02,085 INFO L267 ElimStorePlain]: Start of recursive call 161: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-12 00:01:03,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2018-04-12 00:01:03,525 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:03,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 63 [2018-04-12 00:01:03,527 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:04,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:04,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, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-12 00:01:04,948 INFO L267 ElimStorePlain]: Start of recursive call 164: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:06,232 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 65 [2018-04-12 00:01:06,233 INFO L267 ElimStorePlain]: Start of recursive call 165: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 00:01:07,697 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:07,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 97 [2018-04-12 00:01:07,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 98 [2018-04-12 00:01:07,725 INFO L267 ElimStorePlain]: Start of recursive call 167: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 00:01:07,766 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 75 [2018-04-12 00:01:07,766 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:07,777 INFO L267 ElimStorePlain]: Start of recursive call 166: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-12 00:01:08,669 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 40 treesize of output 38 [2018-04-12 00:01:08,669 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:08,702 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 40 treesize of output 38 [2018-04-12 00:01:08,702 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:09,247 INFO L267 ElimStorePlain]: Start of recursive call 131: 46 dim-1 vars, End of recursive call: 27 dim-0 vars, and 30 xjuncts. [2018-04-12 00:01:09,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 78 [2018-04-12 00:01:09,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-04-12 00:01:09,995 INFO L267 ElimStorePlain]: Start of recursive call 172: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:01:10,072 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 71 [2018-04-12 00:01:10,073 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 2 xjuncts. [2018-04-12 00:01:10,159 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 65 [2018-04-12 00:01:10,161 INFO L267 ElimStorePlain]: Start of recursive call 174: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 00:01:10,261 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 46 treesize of output 42 [2018-04-12 00:01:10,261 INFO L267 ElimStorePlain]: Start of recursive call 175: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:01:10,262 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 46 treesize of output 42 [2018-04-12 00:01:10,263 INFO L267 ElimStorePlain]: Start of recursive call 176: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:01:10,367 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:10,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 85 [2018-04-12 00:01:10,385 INFO L267 ElimStorePlain]: Start of recursive call 177: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:10,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2018-04-12 00:01:10,520 INFO L267 ElimStorePlain]: Start of recursive call 178: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:01:10,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-04-12 00:01:10,638 INFO L267 ElimStorePlain]: Start of recursive call 179: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:01:10,757 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 57 treesize of output 52 [2018-04-12 00:01:10,757 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:10,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 81 [2018-04-12 00:01:10,904 INFO L267 ElimStorePlain]: Start of recursive call 181: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:11,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 55 [2018-04-12 00:01:11,083 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:11,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:11,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 85 [2018-04-12 00:01:11,289 INFO L267 ElimStorePlain]: Start of recursive call 183: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:11,557 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:11,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 78 [2018-04-12 00:01:11,576 INFO L267 ElimStorePlain]: Start of recursive call 184: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:11,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-04-12 00:01:11,918 INFO L267 ElimStorePlain]: Start of recursive call 185: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:01:12,247 INFO L267 ElimStorePlain]: Start of recursive call 171: 13 dim-1 vars, End of recursive call: 20 dim-0 vars, and 22 xjuncts. [2018-04-12 00:01:13,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 86 [2018-04-12 00:01:13,562 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 144 DAG size of output 139 [2018-04-12 00:01:13,565 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:13,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 78 [2018-04-12 00:01:13,583 INFO L267 ElimStorePlain]: Start of recursive call 187: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:13,736 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 72 [2018-04-12 00:01:13,737 INFO L267 ElimStorePlain]: Start of recursive call 188: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 00:01:13,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2018-04-12 00:01:13,895 INFO L267 ElimStorePlain]: Start of recursive call 189: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:01:14,026 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:14,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 85 [2018-04-12 00:01:14,047 INFO L267 ElimStorePlain]: Start of recursive call 190: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:14,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2018-04-12 00:01:14,267 INFO L267 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 2 xjuncts. [2018-04-12 00:01:14,277 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 68 [2018-04-12 00:01:14,278 INFO L267 ElimStorePlain]: Start of recursive call 192: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 00:01:14,459 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 62 treesize of output 58 [2018-04-12 00:01:14,460 INFO L267 ElimStorePlain]: Start of recursive call 193: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:01:14,624 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 60 [2018-04-12 00:01:14,625 INFO L267 ElimStorePlain]: Start of recursive call 194: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 00:01:14,802 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:14,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 85 [2018-04-12 00:01:14,820 INFO L267 ElimStorePlain]: Start of recursive call 195: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:15,035 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 65 [2018-04-12 00:01:15,037 INFO L267 ElimStorePlain]: Start of recursive call 196: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 00:01:15,262 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:15,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 81 [2018-04-12 00:01:15,281 INFO L267 ElimStorePlain]: Start of recursive call 197: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:15,562 INFO L267 ElimStorePlain]: Start of recursive call 186: 10 dim-1 vars, End of recursive call: 17 dim-0 vars, and 20 xjuncts. [2018-04-12 00:01:17,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 126 [2018-04-12 00:01:17,112 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 100 [2018-04-12 00:01:17,114 INFO L267 ElimStorePlain]: Start of recursive call 199: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-12 00:01:17,799 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 74 treesize of output 68 [2018-04-12 00:01:17,799 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:17,801 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 77 treesize of output 71 [2018-04-12 00:01:17,801 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:18,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-04-12 00:01:18,378 INFO L267 ElimStorePlain]: Start of recursive call 202: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:01:19,008 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 84 [2018-04-12 00:01:19,010 INFO L267 ElimStorePlain]: Start of recursive call 203: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-12 00:01:19,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 84 [2018-04-12 00:01:19,766 INFO L267 ElimStorePlain]: Start of recursive call 204: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:20,567 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 90 [2018-04-12 00:01:20,568 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:21,364 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:21,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 80 [2018-04-12 00:01:21,385 INFO L267 ElimStorePlain]: Start of recursive call 206: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:22,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:22,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 77 [2018-04-12 00:01:22,341 INFO L267 ElimStorePlain]: Start of recursive call 207: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:23,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-04-12 00:01:23,419 INFO L267 ElimStorePlain]: Start of recursive call 208: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-12 00:01:24,581 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 84 [2018-04-12 00:01:24,582 INFO L267 ElimStorePlain]: Start of recursive call 209: End of recursive call: and 2 xjuncts. [2018-04-12 00:01:26,196 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 91 treesize of output 83 [2018-04-12 00:01:26,196 INFO L267 ElimStorePlain]: Start of recursive call 210: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:27,465 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 116 treesize of output 112 [2018-04-12 00:01:27,465 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:28,803 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:28,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 87 [2018-04-12 00:01:28,822 INFO L267 ElimStorePlain]: Start of recursive call 212: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:30,373 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 109 treesize of output 101 [2018-04-12 00:01:30,373 INFO L267 ElimStorePlain]: Start of recursive call 213: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:31,934 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 101 treesize of output 99 [2018-04-12 00:01:31,934 INFO L267 ElimStorePlain]: Start of recursive call 214: End of recursive call: and 1 xjuncts. [2018-04-12 00:01:33,575 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:33,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 100 [2018-04-12 00:01:33,595 INFO L267 ElimStorePlain]: Start of recursive call 215: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-04-12 00:01:35,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-12 00:01:35,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 103 [2018-04-12 00:01:35,782 INFO L267 ElimStorePlain]: Start of recursive call 216: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. Received shutdown request... [2018-04-12 00:01:37,046 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-12 00:01:37,046 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-12 00:01:37,050 WARN L197 ceAbstractionStarter]: Timeout [2018-04-12 00:01:37,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.04 12:01:37 BoogieIcfgContainer [2018-04-12 00:01:37,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-12 00:01:37,051 INFO L168 Benchmark]: Toolchain (without parser) took 260109.11 ms. Allocated memory was 305.7 MB in the beginning and 416.3 MB in the end (delta: 110.6 MB). Free memory was 243.2 MB in the beginning and 348.0 MB in the end (delta: -104.7 MB). Peak memory consumption was 350.5 MB. Max. memory is 5.3 GB. [2018-04-12 00:01:37,053 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-12 00:01:37,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.87 ms. Allocated memory is still 305.7 MB. Free memory was 243.2 MB in the beginning and 215.3 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. [2018-04-12 00:01:37,053 INFO L168 Benchmark]: Boogie Preprocessor took 64.39 ms. Allocated memory is still 305.7 MB. Free memory was 215.3 MB in the beginning and 212.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-12 00:01:37,053 INFO L168 Benchmark]: RCFGBuilder took 722.89 ms. Allocated memory was 305.7 MB in the beginning and 469.8 MB in the end (delta: 164.1 MB). Free memory was 211.3 MB in the beginning and 382.2 MB in the end (delta: -170.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. [2018-04-12 00:01:37,054 INFO L168 Benchmark]: TraceAbstraction took 258973.17 ms. Allocated memory was 469.8 MB in the beginning and 416.3 MB in the end (delta: -53.5 MB). Free memory was 380.8 MB in the beginning and 348.0 MB in the end (delta: 32.8 MB). Peak memory consumption was 323.9 MB. Max. memory is 5.3 GB. [2018-04-12 00:01:37,055 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 343.87 ms. Allocated memory is still 305.7 MB. Free memory was 243.2 MB in the beginning and 215.3 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 64.39 ms. Allocated memory is still 305.7 MB. Free memory was 215.3 MB in the beginning and 212.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 722.89 ms. Allocated memory was 305.7 MB in the beginning and 469.8 MB in the end (delta: 164.1 MB). Free memory was 211.3 MB in the beginning and 382.2 MB in the end (delta: -170.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 258973.17 ms. Allocated memory was 469.8 MB in the beginning and 416.3 MB in the end (delta: -53.5 MB). Free memory was 380.8 MB in the beginning and 348.0 MB in the end (delta: 32.8 MB). Peak memory consumption was 323.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1070]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1070). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1059). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1064). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1064). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1003]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1003). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1027). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1059]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1059). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1024). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1046). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1029). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1055]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1013]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1013). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1065). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1025]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1025). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1023). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1060). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1065). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1055]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1055). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1001]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1001). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1026]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1026). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1012]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1012). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1070]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1070). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - TimeoutResultAtElement [Line: 1030]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1030). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 617. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 203 locations, 69 error locations. TIMEOUT Result, 258.9s OverallTime, 27 OverallIterations, 3 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3485 SDtfs, 9621 SDslu, 11654 SDs, 0 SdLazy, 9764 SolverSat, 764 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2126 GetRequests, 1717 SyntacticMatches, 13 SemanticMatches, 396 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2175 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=321occurred in iteration=26, 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, 26 MinimizatonAttempts, 1419 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1906 ConstructedInterpolants, 124 QuantifiedInterpolants, 1150865 SizeOfPredicates, 239 NumberOfNonLiveVariables, 3742 ConjunctsInSsa, 359 ConjunctsInUnsatCore, 52 InterpolantComputations, 38 PerfectInterpolantSequences, 16/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-12_00-01-37-063.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-12_00-01-37-063.csv Completed graceful shutdown