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/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8168ed2-m [2018-04-11 20:57:31,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 20:57:31,839 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 20:57:31,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 20:57:31,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 20:57:31,855 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 20:57:31,856 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 20:57:31,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 20:57:31,859 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 20:57:31,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 20:57:31,861 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 20:57:31,862 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 20:57:31,863 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 20:57:31,864 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 20:57:31,865 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 20:57:31,867 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 20:57:31,870 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 20:57:31,871 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 20:57:31,873 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 20:57:31,874 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 20:57:31,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 20:57:31,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 20:57:31,877 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 20:57:31,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 20:57:31,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 20:57:31,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 20:57:31,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 20:57:31,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 20:57:31,880 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 20:57:31,880 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 20:57:31,881 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 20:57:31,881 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 20:57:31,900 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 20:57:31,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 20:57:31,900 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 20:57:31,901 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 20:57:31,901 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 20:57:31,902 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 20:57:31,902 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 20:57:31,902 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 20:57:31,902 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 20:57:31,902 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 20:57:31,902 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 20:57:31,902 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 20:57:31,903 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 20:57:31,903 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 20:57:31,903 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 20:57:31,903 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 20:57:31,903 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 20:57:31,903 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 20:57:31,904 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 20:57:31,904 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 20:57:31,904 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 20:57:31,904 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 20:57:31,904 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 20:57:31,904 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 20:57:31,905 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 20:57:31,905 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 20:57:31,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 20:57:31,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 20:57:31,905 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 20:57:31,905 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 20:57:31,905 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 20:57:31,906 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 20:57:31,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 20:57:31,906 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 20:57:31,907 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 20:57:31,907 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 20:57:31,907 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 20:57:31,907 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 20:57:31,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 20:57:31,950 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 20:57:31,953 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 20:57:31,954 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 20:57:31,955 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 20:57:31,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,290 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGeb88869c5 [2018-04-11 20:57:32,463 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 20:57:32,463 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 20:57:32,464 INFO L168 CDTParser]: Scanning substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,475 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 20:57:32,475 INFO L215 ultiparseSymbolTable]: [2018-04-11 20:57:32,476 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 20:57:32,476 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ ('') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,476 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,476 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,476 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,476 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 20:57:32,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,476 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__register_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____socklen_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,477 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____intptr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__size_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,478 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsword_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uint in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ssize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__nlink_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__div_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,479 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__uid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__wchar_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__lldiv_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,480 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clockid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____gid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,481 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____id_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____timer_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_char in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,482 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ulong in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int32_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,483 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____off_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_mask in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____caddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_long in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__sigset_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____ino64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,484 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____clock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,485 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____daddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,485 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,485 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__mode_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,485 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____useconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,485 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,485 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,485 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_short in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,485 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fd_set in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,485 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,486 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,486 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,486 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__suseconds_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,486 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____u_int in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,486 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,486 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__fsid_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,486 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____dev_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,486 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,486 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,487 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____time_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,487 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,487 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ushort in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,487 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____qaddr_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,487 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,487 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____blksize_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,487 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,487 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__ino_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,488 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,488 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_int64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,488 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__loff_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,488 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____uint16_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,488 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,488 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____rlim64_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,488 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__u_quad_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,488 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i__int8_t in substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:32,505 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGeb88869c5 [2018-04-11 20:57:32,510 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 20:57:32,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 20:57:32,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 20:57:32,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 20:57:32,519 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 20:57:32,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 08:57:32" (1/1) ... [2018-04-11 20:57:32,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5092c86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32, skipping insertion in model container [2018-04-11 20:57:32,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 08:57:32" (1/1) ... [2018-04-11 20:57:32,536 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 20:57:32,567 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 20:57:32,747 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 20:57:32,793 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 20:57:32,801 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 20:57:32,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32 WrapperNode [2018-04-11 20:57:32,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 20:57:32,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 20:57:32,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 20:57:32,849 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 20:57:32,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32" (1/1) ... [2018-04-11 20:57:32,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32" (1/1) ... [2018-04-11 20:57:32,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32" (1/1) ... [2018-04-11 20:57:32,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32" (1/1) ... [2018-04-11 20:57:32,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32" (1/1) ... [2018-04-11 20:57:32,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32" (1/1) ... [2018-04-11 20:57:32,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32" (1/1) ... [2018-04-11 20:57:32,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 20:57:32,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 20:57:32,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 20:57:32,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 20:57:32,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32" (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 20:57:33,028 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 20:57:33,029 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 20:57:33,029 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 20:57:33,029 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 20:57:33,029 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-04-11 20:57:33,029 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 20:57:33,029 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 20:57:33,029 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fsubstring_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 20:57:33,029 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 20:57:33,030 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 20:57:33,030 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 20:57:33,030 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 20:57:33,030 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 20:57:33,030 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 20:57:33,030 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 20:57:33,031 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 20:57:33,031 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 20:57:33,031 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 20:57:33,031 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 20:57:33,031 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 20:57:33,032 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 20:57:33,032 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 20:57:33,032 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 20:57:33,032 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 20:57:33,032 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 20:57:33,032 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 20:57:33,032 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 20:57:33,033 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 20:57:33,033 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 20:57:33,033 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 20:57:33,033 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 20:57:33,033 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 20:57:33,033 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 20:57:33,034 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 20:57:33,034 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 20:57:33,034 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 20:57:33,034 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 20:57:33,034 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 20:57:33,034 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 20:57:33,034 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 20:57:33,034 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 20:57:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 20:57:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 20:57:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 20:57:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 20:57:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 20:57:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 20:57:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 20:57:33,035 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 20:57:33,036 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 20:57:33,036 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 20:57:33,036 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 20:57:33,036 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 20:57:33,036 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 20:57:33,036 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 20:57:33,036 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 20:57:33,037 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 20:57:33,037 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 20:57:33,037 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 20:57:33,037 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 20:57:33,037 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 20:57:33,037 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 20:57:33,037 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 20:57:33,037 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 20:57:33,038 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 20:57:33,038 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 20:57:33,038 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 20:57:33,038 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 20:57:33,038 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 20:57:33,038 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 20:57:33,038 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 20:57:33,038 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 20:57:33,039 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 20:57:33,039 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 20:57:33,039 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 20:57:33,039 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 20:57:33,039 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 20:57:33,039 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 20:57:33,039 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 20:57:33,039 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 20:57:33,040 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 20:57:33,040 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 20:57:33,040 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 20:57:33,040 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 20:57:33,040 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 20:57:33,040 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 20:57:33,040 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 20:57:33,040 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 20:57:33,041 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 20:57:33,041 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 20:57:33,041 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 20:57:33,041 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 20:57:33,041 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 20:57:33,041 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 20:57:33,041 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 20:57:33,042 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 20:57:33,042 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 20:57:33,042 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 20:57:33,042 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 20:57:33,042 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 20:57:33,042 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 20:57:33,042 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 20:57:33,042 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 20:57:33,043 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 20:57:33,043 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 20:57:33,043 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 20:57:33,043 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 20:57:33,043 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 20:57:33,043 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 20:57:33,043 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-04-11 20:57:33,043 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 20:57:33,044 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 20:57:33,044 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 20:57:33,044 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 20:57:33,044 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 20:57:33,044 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 20:57:33,044 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 20:57:33,044 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 20:57:33,486 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 20:57:33,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 08:57:33 BoogieIcfgContainer [2018-04-11 20:57:33,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 20:57:33,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 20:57:33,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 20:57:33,492 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 20:57:33,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 08:57:32" (1/3) ... [2018-04-11 20:57:33,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49af1bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 08:57:33, skipping insertion in model container [2018-04-11 20:57:33,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 08:57:32" (2/3) ... [2018-04-11 20:57:33,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49af1bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 08:57:33, skipping insertion in model container [2018-04-11 20:57:33,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 08:57:33" (3/3) ... [2018-04-11 20:57:33,495 INFO L107 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-04-11 20:57:33,505 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 20:57:33,514 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-04-11 20:57:33,566 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 20:57:33,566 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 20:57:33,566 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 20:57:33,567 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 20:57:33,567 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 20:57:33,567 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 20:57:33,567 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 20:57:33,567 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 20:57:33,567 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 20:57:33,568 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 20:57:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-04-11 20:57:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 20:57:33,589 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:33,589 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:57:33,590 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash -727582181, 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 20:57:33,605 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:33,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:33,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 6 treesize of output 5 [2018-04-11 20:57:33,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:33,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:33,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:57:33,727 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 20:57:33,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:33,732 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 20:57:33,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 20:57:33,741 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 20:57:33,742 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:33,761 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 20:57:33,786 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:33,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 20:57:33,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 20:57:33,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 20:57:33,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 20:57:33,806 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 4 states. [2018-04-11 20:57:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:33,909 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-04-11 20:57:33,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 20:57:33,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-11 20:57:33,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:33,921 INFO L225 Difference]: With dead ends: 154 [2018-04-11 20:57:33,921 INFO L226 Difference]: Without dead ends: 88 [2018-04-11 20:57:33,925 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 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 20:57:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-11 20:57:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-04-11 20:57:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 20:57:33,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-04-11 20:57:33,965 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 19 [2018-04-11 20:57:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:33,965 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-04-11 20:57:33,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 20:57:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-04-11 20:57:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 20:57:33,966 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:33,966 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:57:33,966 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:33,966 INFO L82 PathProgramCache]: Analyzing trace with hash -727582180, 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 20:57:33,974 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:33,993 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:34,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:57:34,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,021 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 20:57:34,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 20:57:34,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:34,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:34,097 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 20:57:34,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 20:57:34,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 20:57:34,174 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 20:57:34,174 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:34,316 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,317 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-11 20:57:34,325 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 20:57:34,356 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:34,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-11 20:57:34,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 20:57:34,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 20:57:34,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-11 20:57:34,359 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 9 states. [2018-04-11 20:57:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:34,589 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-04-11 20:57:34,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:57:34,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-11 20:57:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:34,591 INFO L225 Difference]: With dead ends: 88 [2018-04-11 20:57:34,591 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 20:57:34,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:57:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 20:57:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-04-11 20:57:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-11 20:57:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-11 20:57:34,598 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2018-04-11 20:57:34,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:34,598 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-11 20:57:34,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 20:57:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-11 20:57:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 20:57:34,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:34,599 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] [2018-04-11 20:57:34,600 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1080211127, 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 20:57:34,609 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:34,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:34,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 20:57:34,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 20:57:34,648 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 20:57:34,648 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:34,652 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 20:57:34,680 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:34,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 20:57:34,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 20:57:34,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 20:57:34,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 20:57:34,681 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 4 states. [2018-04-11 20:57:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:34,730 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-04-11 20:57:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 20:57:34,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-11 20:57:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:34,732 INFO L225 Difference]: With dead ends: 87 [2018-04-11 20:57:34,732 INFO L226 Difference]: Without dead ends: 86 [2018-04-11 20:57:34,732 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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 20:57:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-11 20:57:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-11 20:57:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-11 20:57:34,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-11 20:57:34,738 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 20 [2018-04-11 20:57:34,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:34,739 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-11 20:57:34,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 20:57:34,739 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-11 20:57:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 20:57:34,739 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:34,739 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] [2018-04-11 20:57:34,739 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1080211126, 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 20:57:34,746 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:34,763 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:34,773 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 20:57:34,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:34,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 20:57:34,802 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 20:57:34,802 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:34,838 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 20:57:34,868 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:34,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-11 20:57:34,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:57:34,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:57:34,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:57:34,869 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 7 states. [2018-04-11 20:57:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:34,969 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-04-11 20:57:34,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:57:34,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-11 20:57:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:34,971 INFO L225 Difference]: With dead ends: 86 [2018-04-11 20:57:34,971 INFO L226 Difference]: Without dead ends: 85 [2018-04-11 20:57:34,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:57:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-11 20:57:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-04-11 20:57:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 20:57:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-11 20:57:34,978 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 20 [2018-04-11 20:57:34,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:34,979 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-11 20:57:34,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:57:34,979 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-11 20:57:34,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 20:57:34,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:34,980 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:57:34,980 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:34,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1212360915, 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 20:57:34,987 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:35,001 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:35,017 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 20:57:35,017 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:35,022 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 20:57:35,042 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:35,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 20:57:35,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 20:57:35,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 20:57:35,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:57:35,043 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 6 states. [2018-04-11 20:57:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:35,120 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-11 20:57:35,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:57:35,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 20:57:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:35,122 INFO L225 Difference]: With dead ends: 89 [2018-04-11 20:57:35,122 INFO L226 Difference]: Without dead ends: 88 [2018-04-11 20:57:35,123 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:57:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-11 20:57:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-04-11 20:57:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-11 20:57:35,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-04-11 20:57:35,130 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 26 [2018-04-11 20:57:35,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:35,131 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-04-11 20:57:35,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 20:57:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-04-11 20:57:35,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 20:57:35,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:35,132 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:57:35,132 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1212360916, 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 20:57:35,141 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:35,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:35,213 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 20:57:35,213 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:35,222 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 16 treesize of output 12 [2018-04-11 20:57:35,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:35,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-11 20:57:35,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:35,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:57:35,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 20:57:35,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 20:57:35,274 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:35,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-11 20:57:35,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 20:57:35,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 20:57:35,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 20:57:35,275 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 9 states. [2018-04-11 20:57:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:35,421 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-04-11 20:57:35,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 20:57:35,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-11 20:57:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:35,422 INFO L225 Difference]: With dead ends: 88 [2018-04-11 20:57:35,422 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 20:57:35,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-11 20:57:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 20:57:35,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-04-11 20:57:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-11 20:57:35,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-04-11 20:57:35,430 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 26 [2018-04-11 20:57:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:35,431 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-04-11 20:57:35,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 20:57:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-04-11 20:57:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 20:57:35,432 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:35,432 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] [2018-04-11 20:57:35,432 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:35,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1756922025, 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 20:57:35,444 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:35,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:35,476 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 20:57:35,476 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:35,482 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 20:57:35,503 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:35,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 20:57:35,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 20:57:35,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 20:57:35,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 20:57:35,504 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states. [2018-04-11 20:57:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:35,584 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-04-11 20:57:35,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 20:57:35,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-11 20:57:35,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:35,587 INFO L225 Difference]: With dead ends: 99 [2018-04-11 20:57:35,587 INFO L226 Difference]: Without dead ends: 96 [2018-04-11 20:57:35,588 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:57:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-04-11 20:57:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2018-04-11 20:57:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-11 20:57:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2018-04-11 20:57:35,596 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 32 [2018-04-11 20:57:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:35,596 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2018-04-11 20:57:35,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 20:57:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2018-04-11 20:57:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 20:57:35,597 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:35,597 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] [2018-04-11 20:57:35,597 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:35,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1756922024, 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 20:57:35,606 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:35,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:35,682 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 20:57:35,682 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:35,691 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 12 treesize of output 10 [2018-04-11 20:57:35,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:35,698 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 16 treesize of output 12 [2018-04-11 20:57:35,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:35,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:57:35,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-11 20:57:35,727 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 20:57:35,747 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:35,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-11 20:57:35,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 20:57:35,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 20:57:35,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 20:57:35,748 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 9 states. [2018-04-11 20:57:35,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:35,854 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-04-11 20:57:35,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 20:57:35,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 20:57:35,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:35,855 INFO L225 Difference]: With dead ends: 96 [2018-04-11 20:57:35,855 INFO L226 Difference]: Without dead ends: 93 [2018-04-11 20:57:35,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-11 20:57:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-11 20:57:35,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-04-11 20:57:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 20:57:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-04-11 20:57:35,862 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 32 [2018-04-11 20:57:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:35,863 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-04-11 20:57:35,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 20:57:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-04-11 20:57:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 20:57:35,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:35,864 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] [2018-04-11 20:57:35,864 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1638978851, 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 20:57:35,871 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:35,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:35,910 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 20:57:35,910 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:35,916 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 20:57:35,936 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:35,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-11 20:57:35,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:57:35,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:57:35,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:57:35,937 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 7 states. [2018-04-11 20:57:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:36,029 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-04-11 20:57:36,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 20:57:36,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-04-11 20:57:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:36,030 INFO L225 Difference]: With dead ends: 124 [2018-04-11 20:57:36,030 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 20:57:36,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-04-11 20:57:36,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 20:57:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-04-11 20:57:36,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 20:57:36,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-04-11 20:57:36,037 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 36 [2018-04-11 20:57:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:36,038 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-04-11 20:57:36,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:57:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-04-11 20:57:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 20:57:36,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:36,038 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] [2018-04-11 20:57:36,039 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:36,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1638978850, 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 20:57:36,045 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:36,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:36,130 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 20:57:36,130 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:36,188 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 20:57:36,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:36,190 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 20:57:36,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:3 [2018-04-11 20:57:36,210 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 20:57:36,235 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:36,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 12 [2018-04-11 20:57:36,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 20:57:36,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 20:57:36,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-04-11 20:57:36,236 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 13 states. [2018-04-11 20:57:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:36,449 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-04-11 20:57:36,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 20:57:36,449 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-04-11 20:57:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:36,450 INFO L225 Difference]: With dead ends: 123 [2018-04-11 20:57:36,450 INFO L226 Difference]: Without dead ends: 122 [2018-04-11 20:57:36,451 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-04-11 20:57:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-11 20:57:36,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2018-04-11 20:57:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 20:57:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-04-11 20:57:36,457 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 36 [2018-04-11 20:57:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:36,458 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-04-11 20:57:36,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 20:57:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-04-11 20:57:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 20:57:36,459 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:36,460 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] [2018-04-11 20:57:36,460 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1140513306, 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 20:57:36,469 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:36,490 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:36,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:36,528 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-11 20:57:36,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:36,532 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 20:57:36,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:36,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:36,544 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 20:57:36,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:57:36,619 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-11 20:57:36,626 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-11 20:57:36,634 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 20:57:36,634 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:36,664 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_13| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc14.base_13|) 0)) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_13| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_13| 0)))) is different from false [2018-04-11 20:57:36,675 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_13| Int) (|v_main_#t~malloc13.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_12| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc13.base_12|) 0)) (not (= (select .cse0 |v_main_#t~malloc14.base_13|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc14.base_13| 1) |v_main_#t~malloc13.base_12| 0) |v_main_#t~malloc14.base_13| 0) |c_old(#valid)|)))) is different from false [2018-04-11 20:57:36,698 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 20:57:36,718 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:36,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:57:36,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:57:36,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:57:36,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:57:36,719 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 12 states. [2018-04-11 20:57:36,728 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc14.base_13| Int) (|v_main_#t~malloc13.base_12| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_12| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc13.base_12|) 0)) (not (= (select .cse0 |v_main_#t~malloc14.base_13|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc14.base_13| 1) |v_main_#t~malloc13.base_12| 0) |v_main_#t~malloc14.base_13| 0) |c_old(#valid)|))))) is different from false [2018-04-11 20:57:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:37,164 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-04-11 20:57:37,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:57:37,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-04-11 20:57:37,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:37,165 INFO L225 Difference]: With dead ends: 163 [2018-04-11 20:57:37,165 INFO L226 Difference]: Without dead ends: 148 [2018-04-11 20:57:37,166 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-11 20:57:37,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-11 20:57:37,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2018-04-11 20:57:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-11 20:57:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2018-04-11 20:57:37,176 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 39 [2018-04-11 20:57:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:37,176 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2018-04-11 20:57:37,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:57:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2018-04-11 20:57:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 20:57:37,177 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:37,177 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:57:37,178 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:37,178 INFO L82 PathProgramCache]: Analyzing trace with hash 816330566, 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 20:57:37,184 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:37,207 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:37,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:37,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-11 20:57:37,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 20:57:37,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:37,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:37,263 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 20:57:37,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:57:37,289 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-11 20:57:37,293 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-11 20:57:37,297 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 20:57:37,298 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:37,316 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_15| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_15| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_15| 0)) (not (= (select |c_#valid| |v_main_#t~malloc14.base_15|) 0)))) is different from false [2018-04-11 20:57:37,319 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_14| Int) (|v_main_#t~malloc14.base_15| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_14| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_15|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc14.base_15| 1) |v_main_#t~malloc13.base_14| 0) |v_main_#t~malloc14.base_15| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc13.base_14|) 0))))) is different from false [2018-04-11 20:57:37,332 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 20:57:37,352 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:37,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:57:37,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:57:37,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:57:37,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:57:37,353 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand 12 states. [2018-04-11 20:57:37,361 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc13.base_14| Int) (|v_main_#t~malloc14.base_15| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_14| 1))) (or (not (= (select .cse0 |v_main_#t~malloc14.base_15|) 0)) (= (store (store (store .cse0 |v_main_#t~malloc14.base_15| 1) |v_main_#t~malloc13.base_14| 0) |v_main_#t~malloc14.base_15| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_#t~malloc13.base_14|) 0)))))) is different from false [2018-04-11 20:57:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:37,739 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-11 20:57:37,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:57:37,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-11 20:57:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:37,740 INFO L225 Difference]: With dead ends: 216 [2018-04-11 20:57:37,740 INFO L226 Difference]: Without dead ends: 201 [2018-04-11 20:57:37,741 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-11 20:57:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-11 20:57:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-04-11 20:57:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 20:57:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-04-11 20:57:37,750 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 40 [2018-04-11 20:57:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:37,751 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-04-11 20:57:37,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:57:37,751 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-04-11 20:57:37,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 20:57:37,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:37,752 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 20:57:37,752 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:37,753 INFO L82 PathProgramCache]: Analyzing trace with hash 167863009, 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 20:57:37,761 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:37,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:37,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:37,812 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-11 20:57:37,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 20:57:37,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:37,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:37,823 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 20:57:37,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:57:37,842 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-11 20:57:37,846 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-11 20:57:37,850 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 20:57:37,851 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:37,870 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_17| Int)) (or (not (= (select |c_#valid| |v_main_#t~malloc14.base_17|) 0)) (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_17| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_17| 0)))) is different from false [2018-04-11 20:57:37,875 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc13.base_16| Int) (|v_main_#t~malloc14.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_16| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_17| 1) |v_main_#t~malloc13.base_16| 0) |v_main_#t~malloc14.base_17| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_16|))) (not (= (select .cse0 |v_main_#t~malloc14.base_17|) 0))))) is different from false [2018-04-11 20:57:37,892 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 20:57:37,913 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:37,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:57:37,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:57:37,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:57:37,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:57:37,914 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 12 states. [2018-04-11 20:57:37,926 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc13.base_16| Int) (|v_main_#t~malloc14.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_16| 1))) (or (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc14.base_17| 1) |v_main_#t~malloc13.base_16| 0) |v_main_#t~malloc14.base_17| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc13.base_16|))) (not (= (select .cse0 |v_main_#t~malloc14.base_17|) 0)))))) is different from false [2018-04-11 20:57:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:38,284 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-11 20:57:38,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:57:38,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-04-11 20:57:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:38,285 INFO L225 Difference]: With dead ends: 216 [2018-04-11 20:57:38,285 INFO L226 Difference]: Without dead ends: 201 [2018-04-11 20:57:38,286 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-11 20:57:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-11 20:57:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 143. [2018-04-11 20:57:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 20:57:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2018-04-11 20:57:38,298 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 40 [2018-04-11 20:57:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:38,298 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2018-04-11 20:57:38,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:57:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2018-04-11 20:57:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 20:57:38,299 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:38,299 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] [2018-04-11 20:57:38,299 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:38,299 INFO L82 PathProgramCache]: Analyzing trace with hash 728942431, 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 20:57:38,305 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:38,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:38,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:38,369 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-11 20:57:38,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 20:57:38,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:38,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:38,378 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 20:57:38,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 20:57:38,401 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0))))) is different from true [2018-04-11 20:57:38,405 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc14.base| 1) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0))))) is different from true [2018-04-11 20:57:38,410 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 20:57:38,410 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:38,434 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_19| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc14.base_19| 1) |c_main_#t~malloc13.base| 0) |v_main_#t~malloc14.base_19| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc14.base_19|))))) is different from false [2018-04-11 20:57:38,440 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc14.base_19| Int) (|v_main_#t~malloc13.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_18| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc14.base_19| 1) |v_main_#t~malloc13.base_18| 0) |v_main_#t~malloc14.base_19| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc14.base_19|))) (not (= (select |c_#valid| |v_main_#t~malloc13.base_18|) 0))))) is different from false [2018-04-11 20:57:38,456 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 20:57:38,478 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:38,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-11 20:57:38,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 20:57:38,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 20:57:38,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-11 20:57:38,479 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand 12 states. [2018-04-11 20:57:38,488 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc14.base_19| Int) (|v_main_#t~malloc13.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc13.base_18| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc14.base_19| 1) |v_main_#t~malloc13.base_18| 0) |v_main_#t~malloc14.base_19| 0) |c_old(#valid)|) (not (= 0 (select .cse0 |v_main_#t~malloc14.base_19|))) (not (= (select |c_#valid| |v_main_#t~malloc13.base_18|) 0))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-11 20:57:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:38,865 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-04-11 20:57:38,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 20:57:38,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-11 20:57:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:38,867 INFO L225 Difference]: With dead ends: 149 [2018-04-11 20:57:38,867 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 20:57:38,867 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-11 20:57:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 20:57:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2018-04-11 20:57:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 20:57:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-11 20:57:38,875 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 41 [2018-04-11 20:57:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:38,875 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-11 20:57:38,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 20:57:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-11 20:57:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 20:57:38,876 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:38,876 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] [2018-04-11 20:57:38,876 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2128226393, 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 20:57:38,893 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:38,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:57:38,914 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:57:38,937 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:38,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 20:57:38,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 20:57:38,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 20:57:38,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 20:57:38,938 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 3 states. [2018-04-11 20:57:38,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:38,951 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2018-04-11 20:57:38,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 20:57:38,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-04-11 20:57:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:38,952 INFO L225 Difference]: With dead ends: 121 [2018-04-11 20:57:38,952 INFO L226 Difference]: Without dead ends: 75 [2018-04-11 20:57:38,953 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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 20:57:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-11 20:57:38,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-04-11 20:57:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 20:57:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-04-11 20:57:38,960 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 47 [2018-04-11 20:57:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:38,960 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-04-11 20:57:38,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 20:57:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-04-11 20:57:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 20:57:38,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:38,961 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] [2018-04-11 20:57:38,961 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:38,961 INFO L82 PathProgramCache]: Analyzing trace with hash 482289896, 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 20:57:38,967 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:38,983 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:39,001 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 20:57:39,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 11 treesize of output 3 [2018-04-11 20:57:39,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:39,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:39,006 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 20:57:39,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-11 20:57:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:57:39,012 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:57:39,053 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:39,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2018-04-11 20:57:39,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 20:57:39,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 20:57:39,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:57:39,054 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 8 states. [2018-04-11 20:57:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:39,158 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-04-11 20:57:39,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 20:57:39,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-04-11 20:57:39,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:39,159 INFO L225 Difference]: With dead ends: 128 [2018-04-11 20:57:39,159 INFO L226 Difference]: Without dead ends: 74 [2018-04-11 20:57:39,160 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 20:57:39,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-11 20:57:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-11 20:57:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 20:57:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-04-11 20:57:39,166 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 47 [2018-04-11 20:57:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:39,166 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-04-11 20:57:39,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 20:57:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-04-11 20:57:39,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 20:57:39,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:39,167 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] [2018-04-11 20:57:39,167 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:39,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1413739344, 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 20:57:39,174 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:39,193 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:39,217 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 20:57:39,217 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:39,224 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 20:57:39,244 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:39,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-11 20:57:39,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:57:39,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:57:39,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:57:39,245 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 7 states. [2018-04-11 20:57:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:39,300 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-04-11 20:57:39,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 20:57:39,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-11 20:57:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:39,301 INFO L225 Difference]: With dead ends: 78 [2018-04-11 20:57:39,301 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 20:57:39,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:57:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 20:57:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-04-11 20:57:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-11 20:57:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-04-11 20:57:39,309 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 50 [2018-04-11 20:57:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:39,310 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-04-11 20:57:39,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:57:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-04-11 20:57:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 20:57:39,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:39,310 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] [2018-04-11 20:57:39,310 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:39,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1413739345, 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 20:57:39,317 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:39,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:39,357 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 14 treesize of output 11 [2018-04-11 20:57:39,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 20:57:39,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:39,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:39,371 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 20:57:39,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-11 20:57:39,431 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 20:57:39,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 20:57:39,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:57:39,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:57:39,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:57:39,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33 [2018-04-11 20:57:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:57:39,534 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:39,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-04-11 20:57:39,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:39,754 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 25 [2018-04-11 20:57:39,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:39,762 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 20:57:39,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 20:57:39,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:39,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:39,780 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 20:57:39,789 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 20:57:39,789 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:39,792 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:39,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:57:39,797 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:57, output treesize:17 [2018-04-11 20:57:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:57:39,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:57:39,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-04-11 20:57:39,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 20:57:39,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 20:57:39,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-04-11 20:57:39,873 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 25 states. [2018-04-11 20:57:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:40,605 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-04-11 20:57:40,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 20:57:40,605 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-11 20:57:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:40,608 INFO L225 Difference]: With dead ends: 146 [2018-04-11 20:57:40,608 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 20:57:40,609 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 20:57:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 20:57:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2018-04-11 20:57:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-04-11 20:57:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-04-11 20:57:40,623 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 50 [2018-04-11 20:57:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:40,623 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-04-11 20:57:40,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 20:57:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-04-11 20:57:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 20:57:40,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:40,624 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] [2018-04-11 20:57:40,624 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash -270711663, 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 20:57:40,634 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:40,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:40,684 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 20:57:40,684 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:40,692 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 20:57:40,719 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:40,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-11 20:57:40,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 20:57:40,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 20:57:40,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 20:57:40,720 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 7 states. [2018-04-11 20:57:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:40,790 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-04-11 20:57:40,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 20:57:40,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-11 20:57:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:40,800 INFO L225 Difference]: With dead ends: 87 [2018-04-11 20:57:40,800 INFO L226 Difference]: Without dead ends: 86 [2018-04-11 20:57:40,800 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-11 20:57:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-11 20:57:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-11 20:57:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-11 20:57:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-04-11 20:57:40,809 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 50 [2018-04-11 20:57:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:40,810 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-04-11 20:57:40,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 20:57:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-04-11 20:57:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 20:57:40,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:40,810 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] [2018-04-11 20:57:40,811 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash -270711662, 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 20:57:40,819 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:40,840 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:40,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 20:57:40,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:40,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:40,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 20:57:40,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:40,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:40,876 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 20:57:40,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:40,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:40,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 20:57:40,896 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 14 treesize of output 11 [2018-04-11 20:57:40,897 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 11 treesize of output 10 [2018-04-11 20:57:40,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:40,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:40,906 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 20:57:40,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-11 20:57:40,922 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 25 treesize of output 26 [2018-04-11 20:57:40,933 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 11 treesize of output 10 [2018-04-11 20:57:40,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:40,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:40,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 20:57:40,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-11 20:57:41,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 20:57:41,028 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 14 treesize of output 11 [2018-04-11 20:57:41,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:57:41,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-11 20:57:41,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:41,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:57:41,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:57:41,053 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-04-11 20:57:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:57:41,157 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:41,484 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 16 treesize of output 12 [2018-04-11 20:57:41,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:41,501 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 13 treesize of output 11 [2018-04-11 20:57:41,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 5 treesize of output 3 [2018-04-11 20:57:41,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:41,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:41,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:41,540 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-04-11 20:57:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:57:41,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:57:41,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-04-11 20:57:41,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 20:57:41,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 20:57:41,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-04-11 20:57:41,611 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 25 states. [2018-04-11 20:57:42,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:42,342 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2018-04-11 20:57:42,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 20:57:42,342 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-11 20:57:42,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:42,343 INFO L225 Difference]: With dead ends: 198 [2018-04-11 20:57:42,343 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 20:57:42,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=1185, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 20:57:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 20:57:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 140. [2018-04-11 20:57:42,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-11 20:57:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-04-11 20:57:42,359 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 50 [2018-04-11 20:57:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:42,359 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-04-11 20:57:42,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 20:57:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-04-11 20:57:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 20:57:42,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:42,360 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:57:42,360 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:42,361 INFO L82 PathProgramCache]: Analyzing trace with hash -544277930, 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 20:57:42,369 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:42,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 20:57:42,416 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-11 20:57:42,455 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 20:57:42,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-04-11 20:57:42,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 20:57:42,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 20:57:42,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 20:57:42,456 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 8 states. [2018-04-11 20:57:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:42,539 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-04-11 20:57:42,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 20:57:42,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-04-11 20:57:42,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:42,540 INFO L225 Difference]: With dead ends: 140 [2018-04-11 20:57:42,540 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 20:57:42,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-04-11 20:57:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 20:57:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-04-11 20:57:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 20:57:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 147 transitions. [2018-04-11 20:57:42,560 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 147 transitions. Word has length 54 [2018-04-11 20:57:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:42,560 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-04-11 20:57:42,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 20:57:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 147 transitions. [2018-04-11 20:57:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 20:57:42,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:42,561 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:57:42,561 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:42,562 INFO L82 PathProgramCache]: Analyzing trace with hash -544277929, 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 20:57:42,571 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:42,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:42,596 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 20:57:42,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:42,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:42,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 20:57:42,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:42,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:42,610 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 20:57:42,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:42,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:42,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 20:57:42,627 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 14 treesize of output 11 [2018-04-11 20:57:42,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10 [2018-04-11 20:57:42,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:42,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:42,636 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 20:57:42,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-11 20:57:42,652 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 25 treesize of output 26 [2018-04-11 20:57:42,656 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 11 treesize of output 10 [2018-04-11 20:57:42,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:42,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:42,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 20:57:42,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-11 20:57:43,486 WARN L148 SmtUtils]: Spent 633ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-11 20:57:43,563 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 43 treesize of output 53 [2018-04-11 20:57:43,573 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 41 treesize of output 39 [2018-04-11 20:57:43,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:57:43,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-04-11 20:57:43,625 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 20:57:43,678 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 31 treesize of output 23 [2018-04-11 20:57:43,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:43,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-11 20:57:43,681 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:43,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-04-11 20:57:43,743 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-11 20:57:43,816 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 35 treesize of output 28 [2018-04-11 20:57:43,816 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:43,818 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 31 treesize of output 24 [2018-04-11 20:57:43,819 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:43,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 20 [2018-04-11 20:57:43,885 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:43,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-04-11 20:57:43,887 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:43,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-04-11 20:57:43,948 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:43,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 20:57:43,951 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:43,953 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 31 treesize of output 23 [2018-04-11 20:57:43,953 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:44,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 20:57:44,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 20:57:44,106 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-04-11 20:57:44,244 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 20:57:44,244 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:44,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 20:57:44,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:44,896 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 26 treesize of output 28 [2018-04-11 20:57:44,925 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 21 treesize of output 15 [2018-04-11 20:57:44,925 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:44,931 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:44,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:44,939 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-04-11 20:57:44,986 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 20:57:45,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:57:45,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2018-04-11 20:57:45,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 20:57:45,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 20:57:45,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 20:57:45,008 INFO L87 Difference]: Start difference. First operand 139 states and 147 transitions. Second operand 37 states. [2018-04-11 20:57:46,299 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 104 DAG size of output 79 [2018-04-11 20:57:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:48,014 INFO L93 Difference]: Finished difference Result 187 states and 194 transitions. [2018-04-11 20:57:48,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 20:57:48,015 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 54 [2018-04-11 20:57:48,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:48,016 INFO L225 Difference]: With dead ends: 187 [2018-04-11 20:57:48,016 INFO L226 Difference]: Without dead ends: 186 [2018-04-11 20:57:48,017 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=795, Invalid=4035, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 20:57:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-11 20:57:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 143. [2018-04-11 20:57:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 20:57:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-04-11 20:57:48,031 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 54 [2018-04-11 20:57:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:48,032 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-04-11 20:57:48,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 20:57:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-04-11 20:57:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 20:57:48,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:48,033 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:57:48,033 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash -555566326, now seen corresponding path program 2 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 20:57:48,039 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:48,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:48,063 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 20:57:48,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:48,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:48,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 20:57:48,075 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 15 treesize of output 12 [2018-04-11 20:57:48,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 20:57:48,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:48,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:48,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:48,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 20:57:48,127 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 20:57:48,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 20:57:48,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:57:48,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:57:48,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:57:48,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-11 20:57:48,228 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:57:48,228 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:57:48,559 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 13 [2018-04-11 20:57:48,570 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 7 treesize of output 3 [2018-04-11 20:57:48,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:48,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:48,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:57:48,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2018-04-11 20:57:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:57:48,669 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:57:48,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-04-11 20:57:48,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 20:57:48,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 20:57:48,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-04-11 20:57:48,670 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 30 states. [2018-04-11 20:57:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:57:49,676 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2018-04-11 20:57:49,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 20:57:49,677 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-04-11 20:57:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:57:49,678 INFO L225 Difference]: With dead ends: 222 [2018-04-11 20:57:49,678 INFO L226 Difference]: Without dead ends: 221 [2018-04-11 20:57:49,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=492, Invalid=1958, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 20:57:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-11 20:57:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 128. [2018-04-11 20:57:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 20:57:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-04-11 20:57:49,698 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 68 [2018-04-11 20:57:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:57:49,698 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-04-11 20:57:49,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 20:57:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-04-11 20:57:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 20:57:49,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:57:49,700 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:57:49,700 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:57:49,700 INFO L82 PathProgramCache]: Analyzing trace with hash -375308912, now seen corresponding path program 2 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 20:57:49,710 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:57:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:57:49,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:57:49,746 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 20:57:49,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:49,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:49,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 20:57:49,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:49,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:49,760 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 20:57:49,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:49,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:49,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 20:57:49,775 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 14 treesize of output 11 [2018-04-11 20:57:49,777 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 11 treesize of output 10 [2018-04-11 20:57:49,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:49,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:49,783 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 20:57:49,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-11 20:57:49,797 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 25 treesize of output 26 [2018-04-11 20:57:49,799 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 11 treesize of output 10 [2018-04-11 20:57:49,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:49,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:57:49,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 20:57:49,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-11 20:57:50,605 WARN L148 SmtUtils]: Spent 651ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-11 20:57:52,505 WARN L148 SmtUtils]: Spent 612ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 20:57:52,660 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 92 [2018-04-11 20:57:52,680 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 64 treesize of output 57 [2018-04-11 20:57:52,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:53,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:53,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 92 [2018-04-11 20:57:53,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-04-11 20:57:54,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:54,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:54,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:54,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 84 [2018-04-11 20:57:54,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-11 20:57:55,523 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 63 treesize of output 60 [2018-04-11 20:57:55,524 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:55,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 61 [2018-04-11 20:57:55,527 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:55,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:55,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:55,532 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 53 treesize of output 47 [2018-04-11 20:57:55,532 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:55,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:55,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:55,536 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 57 treesize of output 51 [2018-04-11 20:57:55,536 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:55,538 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 57 [2018-04-11 20:57:55,539 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:56,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-04-11 20:57:56,471 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 20:57:57,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:57,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 106 [2018-04-11 20:57:57,390 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 28 xjuncts. [2018-04-11 20:57:58,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:57:58,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 124 [2018-04-11 20:57:58,612 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 20:57:58,620 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 28 xjuncts. [2018-04-11 20:58:00,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:00,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 106 [2018-04-11 20:58:00,944 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 30 xjuncts. [2018-04-11 20:58:02,297 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 63 treesize of output 55 [2018-04-11 20:58:02,298 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:02,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 69 treesize of output 61 [2018-04-11 20:58:02,301 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:02,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-04-11 20:58:02,303 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:02,305 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 20:58:02,306 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:03,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-04-11 20:58:03,408 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:04,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:04,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 120 [2018-04-11 20:58:04,523 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 20:58:04,529 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 24 xjuncts. [2018-04-11 20:58:05,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:05,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:05,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:05,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 67 [2018-04-11 20:58:05,558 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:07,060 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 68 treesize of output 61 [2018-04-11 20:58:07,060 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:07,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:07,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 70 [2018-04-11 20:58:07,825 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:09,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-04-11 20:58:09,379 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:09,381 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 56 treesize of output 49 [2018-04-11 20:58:09,382 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:10,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:10,164 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 76 [2018-04-11 20:58:10,183 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 3 xjuncts. [2018-04-11 20:58:10,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-04-11 20:58:10,966 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:10,967 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 45 treesize of output 37 [2018-04-11 20:58:10,968 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:11,740 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 55 treesize of output 48 [2018-04-11 20:58:11,741 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:11,743 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 51 treesize of output 44 [2018-04-11 20:58:11,743 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:12,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2018-04-11 20:58:12,392 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:13,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:13,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 65 [2018-04-11 20:58:13,703 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:13,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:13,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:13,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:13,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 57 [2018-04-11 20:58:13,713 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:14,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-04-11 20:58:14,315 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:15,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:15,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:15,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:15,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2018-04-11 20:58:15,431 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:16,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:16,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:16,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:16,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:16,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 109 [2018-04-11 20:58:16,043 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 8 xjuncts. [2018-04-11 20:58:16,764 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 60 treesize of output 52 [2018-04-11 20:58:16,765 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:19,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2018-04-11 20:58:19,479 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:20,189 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 67 [2018-04-11 20:58:20,189 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:20,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2018-04-11 20:58:20,192 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:20,194 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 77 [2018-04-11 20:58:20,194 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:20,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76 [2018-04-11 20:58:20,197 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:20,199 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 68 treesize of output 66 [2018-04-11 20:58:20,199 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:20,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:20,855 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 72 [2018-04-11 20:58:20,883 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 3 xjuncts. [2018-04-11 20:58:21,549 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 64 treesize of output 56 [2018-04-11 20:58:21,549 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:22,197 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 46 treesize of output 45 [2018-04-11 20:58:22,197 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:22,203 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 50 treesize of output 49 [2018-04-11 20:58:22,204 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:22,740 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 52 treesize of output 45 [2018-04-11 20:58:22,740 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:23,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:23,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 54 [2018-04-11 20:58:23,224 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:23,692 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 48 [2018-04-11 20:58:23,693 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:25,004 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 60 treesize of output 52 [2018-04-11 20:58:25,004 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:25,439 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 47 treesize of output 44 [2018-04-11 20:58:25,440 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:25,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:25,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 61 [2018-04-11 20:58:25,841 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:25,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:25,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:25,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:25,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 53 [2018-04-11 20:58:25,851 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:26,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:26,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:26,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:26,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 82 [2018-04-11 20:58:26,276 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 8 xjuncts. [2018-04-11 20:58:26,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-04-11 20:58:26,657 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:28,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:58:28,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 94 [2018-04-11 20:58:28,255 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 30 xjuncts. [2018-04-11 20:58:29,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 57 dim-1 vars, End of recursive call: and 20 xjuncts. [2018-04-11 20:58:30,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-11 20:58:30,027 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 10 variables, input treesize:86, output treesize:135 [2018-04-11 20:58:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 24 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:58:30,261 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:58:33,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 20:58:33,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:33,913 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 239 treesize of output 119 [2018-04-11 20:58:34,034 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-04-11 20:58:34,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 20:58:34,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:34,078 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 66 treesize of output 76 [2018-04-11 20:58:34,084 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 86 [2018-04-11 20:58:34,102 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-04-11 20:58:34,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-04-11 20:58:34,295 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:34,368 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,369 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,371 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 68 [2018-04-11 20:58:34,377 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:34,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-04-11 20:58:34,462 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:34,633 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 44 [2018-04-11 20:58:34,633 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:34,716 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2018-04-11 20:58:34,717 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:34,719 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2018-04-11 20:58:34,720 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:34,850 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 63 [2018-04-11 20:58:34,857 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:34,971 INFO L267 ElimStorePlain]: Start of recursive call 5: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:58:34,986 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 3 case distinctions, treesize of input 62 treesize of output 72 [2018-04-11 20:58:34,991 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,991 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,991 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,992 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,993 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:34,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2018-04-11 20:58:34,994 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:35,110 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,111 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,112 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 66 [2018-04-11 20:58:35,118 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:35,240 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 82 [2018-04-11 20:58:35,257 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 8 xjuncts. [2018-04-11 20:58:35,356 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 42 treesize of output 40 [2018-04-11 20:58:35,357 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:35,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 69 [2018-04-11 20:58:35,636 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:35,713 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 41 treesize of output 45 [2018-04-11 20:58:35,714 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:35,872 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 39 treesize of output 37 [2018-04-11 20:58:35,872 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:35,908 INFO L267 ElimStorePlain]: Start of recursive call 14: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:58:35,923 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 3 case distinctions, treesize of input 55 treesize of output 65 [2018-04-11 20:58:35,927 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,928 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,928 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,928 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,930 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:35,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 49 [2018-04-11 20:58:35,931 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:36,032 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 50 treesize of output 42 [2018-04-11 20:58:36,033 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:36,130 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:36,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 78 [2018-04-11 20:58:36,146 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 8 xjuncts. [2018-04-11 20:58:36,276 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 39 [2018-04-11 20:58:36,276 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:36,377 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:36,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 55 [2018-04-11 20:58:36,384 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:36,490 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 34 treesize of output 38 [2018-04-11 20:58:36,491 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:36,621 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:36,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 78 [2018-04-11 20:58:36,638 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 8 xjuncts. [2018-04-11 20:58:36,761 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:36,761 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:36,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:36,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 59 [2018-04-11 20:58:36,768 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-04-11 20:58:36,823 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:36,898 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:36,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 75 [2018-04-11 20:58:36,914 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 8 xjuncts. [2018-04-11 20:58:36,958 INFO L267 ElimStorePlain]: Start of recursive call 22: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:58:36,974 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 3 case distinctions, treesize of input 62 treesize of output 72 [2018-04-11 20:58:36,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 46 [2018-04-11 20:58:36,978 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:37,090 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 62 [2018-04-11 20:58:37,097 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:37,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,223 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,224 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2018-04-11 20:58:37,225 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:37,340 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 82 [2018-04-11 20:58:37,356 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 8 xjuncts. [2018-04-11 20:58:37,454 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,454 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,456 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 64 [2018-04-11 20:58:37,461 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:37,534 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 44 treesize of output 42 [2018-04-11 20:58:37,534 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:37,599 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 39 treesize of output 37 [2018-04-11 20:58:37,599 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:37,658 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,658 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,658 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,659 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:58:37,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2018-04-11 20:58:37,661 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:37,716 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 42 treesize of output 40 [2018-04-11 20:58:37,717 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-11 20:58:37,824 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 41 treesize of output 45 [2018-04-11 20:58:37,824 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-04-11 20:58:37,937 INFO L267 ElimStorePlain]: Start of recursive call 33: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:58:38,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 32 xjuncts. [2018-04-11 20:58:38,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 20:58:38,154 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 10 variables, input treesize:260, output treesize:37 [2018-04-11 20:58:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:58:38,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:58:38,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 27] total 55 [2018-04-11 20:58:38,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 20:58:38,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 20:58:38,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2824, Unknown=2, NotChecked=0, Total=3080 [2018-04-11 20:58:38,245 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 56 states. [2018-04-11 20:58:40,583 WARN L151 SmtUtils]: Spent 1437ms on a formula simplification. DAG size of input: 87 DAG size of output 75 [2018-04-11 20:58:43,013 WARN L151 SmtUtils]: Spent 2087ms on a formula simplification. DAG size of input: 104 DAG size of output 79 [2018-04-11 20:58:46,300 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 114 DAG size of output 94 [2018-04-11 20:58:48,597 WARN L151 SmtUtils]: Spent 2088ms on a formula simplification. DAG size of input: 107 DAG size of output 78 [2018-04-11 20:58:48,809 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 116 DAG size of output 92 [2018-04-11 20:58:50,668 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 106 DAG size of output 87 [2018-04-11 20:58:52,878 WARN L151 SmtUtils]: Spent 2097ms on a formula simplification. DAG size of input: 106 DAG size of output 84 [2018-04-11 20:58:53,305 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 125 DAG size of output 91 [2018-04-11 20:58:54,793 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 138 DAG size of output 108 [2018-04-11 20:58:56,372 WARN L151 SmtUtils]: Spent 1486ms on a formula simplification. DAG size of input: 141 DAG size of output 94 [2018-04-11 20:58:59,027 WARN L151 SmtUtils]: Spent 2477ms on a formula simplification. DAG size of input: 140 DAG size of output 92 [2018-04-11 20:59:00,182 WARN L151 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 130 DAG size of output 106 [2018-04-11 20:59:03,159 WARN L151 SmtUtils]: Spent 2398ms on a formula simplification. DAG size of input: 138 DAG size of output 90 [2018-04-11 20:59:03,893 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 128 DAG size of output 104 [2018-04-11 20:59:07,382 WARN L151 SmtUtils]: Spent 2798ms on a formula simplification. DAG size of input: 117 DAG size of output 88 [2018-04-11 20:59:11,461 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 98 DAG size of output 79 [2018-04-11 20:59:11,771 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 120 DAG size of output 94 [2018-04-11 20:59:14,107 WARN L151 SmtUtils]: Spent 972ms on a formula simplification. DAG size of input: 110 DAG size of output 88 [2018-04-11 20:59:20,425 WARN L151 SmtUtils]: Spent 6191ms on a formula simplification. DAG size of input: 110 DAG size of output 85 [2018-04-11 20:59:24,469 WARN L151 SmtUtils]: Spent 3899ms on a formula simplification. DAG size of input: 114 DAG size of output 89 [2018-04-11 20:59:28,448 WARN L151 SmtUtils]: Spent 3844ms on a formula simplification. DAG size of input: 126 DAG size of output 92 [2018-04-11 20:59:28,682 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 139 DAG size of output 109 [2018-04-11 20:59:31,058 WARN L151 SmtUtils]: Spent 2264ms on a formula simplification. DAG size of input: 142 DAG size of output 95 [2018-04-11 20:59:31,420 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 141 DAG size of output 93 [2018-04-11 20:59:33,150 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 131 DAG size of output 107 [2018-04-11 20:59:33,782 WARN L151 SmtUtils]: Spent 395ms on a formula simplification. DAG size of input: 139 DAG size of output 91 [2018-04-11 20:59:35,130 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 129 DAG size of output 105 [2018-04-11 20:59:37,948 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 123 DAG size of output 95 [2018-04-11 20:59:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:59:38,783 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2018-04-11 20:59:38,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-11 20:59:38,783 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 72 [2018-04-11 20:59:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:59:38,784 INFO L225 Difference]: With dead ends: 173 [2018-04-11 20:59:38,784 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 20:59:38,787 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3331 ImplicationChecksByTransitivity, 61.5s TimeCoverageRelationStatistics Valid=2667, Invalid=12089, Unknown=6, NotChecked=0, Total=14762 [2018-04-11 20:59:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 20:59:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 104. [2018-04-11 20:59:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 20:59:38,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-04-11 20:59:38,798 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 72 [2018-04-11 20:59:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:59:38,798 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-04-11 20:59:38,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 20:59:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-04-11 20:59:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 20:59:38,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:59:38,799 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 20:59:38,800 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:59:38,800 INFO L82 PathProgramCache]: Analyzing trace with hash 493848144, now seen corresponding path program 2 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 20:59:38,809 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:59:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:59:38,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:59:38,839 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 20:59:38,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,845 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 20:59:38,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 20:59:38,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:59:38,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 20:59:38,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:59:38,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:59:38,873 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 20:59:38,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 20:59:38,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 20:59:38,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 20:59:38,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 20:59:38,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 20:59:38,958 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 13 treesize of output 12 [2018-04-11 20:59:38,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:38,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 20:59:38,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-11 20:59:39,112 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 31 treesize of output 29 [2018-04-11 20:59:39,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 20:59:39,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:59:39,126 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 10 treesize of output 1 [2018-04-11 20:59:39,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:39,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:59:39,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:59:39,137 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-11 20:59:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:59:39,252 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:59:39,737 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 13 treesize of output 11 [2018-04-11 20:59:39,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 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 20:59:39,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:39,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:39,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 20:59:39,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-04-11 20:59:40,335 WARN L148 SmtUtils]: Spent 489ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-11 20:59:40,705 WARN L148 SmtUtils]: Spent 325ms on a formula simplification that was a NOOP. DAG size: 34 [2018-04-11 20:59:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:59:40,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:59:40,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2018-04-11 20:59:40,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 20:59:40,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 20:59:40,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2018-04-11 20:59:40,748 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 32 states. [2018-04-11 20:59:42,022 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 67 DAG size of output 53 [2018-04-11 20:59:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 20:59:42,471 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2018-04-11 20:59:42,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 20:59:42,472 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 74 [2018-04-11 20:59:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 20:59:42,473 INFO L225 Difference]: With dead ends: 142 [2018-04-11 20:59:42,473 INFO L226 Difference]: Without dead ends: 141 [2018-04-11 20:59:42,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=448, Invalid=2204, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 20:59:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-11 20:59:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 91. [2018-04-11 20:59:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-11 20:59:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-04-11 20:59:42,486 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 74 [2018-04-11 20:59:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 20:59:42,486 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-04-11 20:59:42,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 20:59:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-04-11 20:59:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 20:59:42,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 20:59:42,486 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-04-11 20:59:42,487 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 20:59:42,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1836176107, 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 20:59:42,492 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 20:59:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 20:59:42,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 20:59:42,548 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 20:59:42,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:42,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:42,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 20:59:42,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:59:42,578 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:59:42,579 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 20:59:42,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:42,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:42,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 20:59:42,596 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 14 treesize of output 11 [2018-04-11 20:59:42,598 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 11 treesize of output 10 [2018-04-11 20:59:42,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:42,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:42,605 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 20:59:42,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-11 20:59:42,619 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 25 treesize of output 26 [2018-04-11 20:59:42,621 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 11 treesize of output 10 [2018-04-11 20:59:42,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:42,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:42,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 20:59:42,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-11 20:59:43,984 WARN L148 SmtUtils]: Spent 1007ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-11 20:59:44,086 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 53 treesize of output 61 [2018-04-11 20:59:44,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:59:44,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 58 [2018-04-11 20:59:44,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 20:59:44,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:59:44,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 72 [2018-04-11 20:59:44,204 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 20:59:44,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:59:44,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 87 [2018-04-11 20:59:44,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-11 20:59:44,472 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 28 [2018-04-11 20:59:44,472 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:44,474 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 40 treesize of output 32 [2018-04-11 20:59:44,474 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:44,575 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 40 treesize of output 32 [2018-04-11 20:59:44,575 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:44,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-04-11 20:59:44,577 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:44,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-04-11 20:59:44,579 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:44,648 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 49 treesize of output 42 [2018-04-11 20:59:44,648 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:44,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 20:59:44,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 51 [2018-04-11 20:59:44,711 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 20:59:44,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-04-11 20:59:44,774 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:44,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-11 20:59:44,776 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:44,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-04-11 20:59:44,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 20:59:44,896 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:75, output treesize:104 [2018-04-11 20:59:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:59:45,071 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 20:59:46,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 20:59:46,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:46,064 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 41 treesize of output 41 [2018-04-11 20:59:46,111 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:59:46,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-04-11 20:59:46,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 20:59:46,165 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 20:59:46,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2018-04-11 20:59:46,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 20:59:46,180 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:46,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 20:59:46,190 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:84, output treesize:10 [2018-04-11 20:59:46,255 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 20:59:46,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 20:59:46,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2018-04-11 20:59:46,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 20:59:46,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 20:59:46,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1817, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 20:59:46,276 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand 45 states. [2018-04-11 20:59:50,017 WARN L151 SmtUtils]: Spent 1560ms on a formula simplification. DAG size of input: 108 DAG size of output 92 [2018-04-11 20:59:54,192 WARN L151 SmtUtils]: Spent 4107ms on a formula simplification. DAG size of input: 108 DAG size of output 89 [2018-04-11 20:59:55,119 WARN L151 SmtUtils]: Spent 863ms on a formula simplification. DAG size of input: 121 DAG size of output 93 [2018-04-11 21:00:07,188 WARN L151 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 103 DAG size of output 87 [2018-04-11 21:00:09,242 WARN L151 SmtUtils]: Spent 916ms on a formula simplification. DAG size of input: 80 DAG size of output 67 [2018-04-11 21:00:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:00:09,273 INFO L93 Difference]: Finished difference Result 191 states and 198 transitions. [2018-04-11 21:00:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-11 21:00:09,273 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 78 [2018-04-11 21:00:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:00:09,274 INFO L225 Difference]: With dead ends: 191 [2018-04-11 21:00:09,274 INFO L226 Difference]: Without dead ends: 190 [2018-04-11 21:00:09,276 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2064 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=1449, Invalid=7860, Unknown=3, NotChecked=0, Total=9312 [2018-04-11 21:00:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-11 21:00:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 109. [2018-04-11 21:00:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-11 21:00:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2018-04-11 21:00:09,297 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 78 [2018-04-11 21:00:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:00:09,298 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2018-04-11 21:00:09,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 21:00:09,298 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2018-04-11 21:00:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-04-11 21:00:09,299 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:00:09,299 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:00:09,299 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-04-11 21:00:09,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1718385870, 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 21:00:09,307 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 21:00:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:00:09,339 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:00:09,342 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 21:00:09,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:09,347 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 21:00:09,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:09,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:00:09,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 21:00:09,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:09,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:09,362 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 21:00:09,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:09,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 21:00:09,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:09,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:00:09,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-04-11 21:00:09,388 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 16 treesize of output 13 [2018-04-11 21:00:09,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 21:00:09,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:09,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:00:09,396 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 21:00:09,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-04-11 21:00:09,411 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 21:00:09,412 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 13 treesize of output 12 [2018-04-11 21:00:09,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:09,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:00:09,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:00:09,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-04-11 21:00:11,778 WARN L148 SmtUtils]: Spent 2027ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-11 21:00:14,301 WARN L148 SmtUtils]: Spent 2035ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 21:00:14,457 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 96 [2018-04-11 21:00:14,469 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 72 treesize of output 64 [2018-04-11 21:00:14,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:15,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:15,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 144 [2018-04-11 21:00:15,411 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 21:00:15,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 24 xjuncts. [2018-04-11 21:00:16,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:16,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 140 [2018-04-11 21:00:16,613 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 21:00:16,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 24 xjuncts. [2018-04-11 21:00:17,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-04-11 21:00:17,820 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:18,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:18,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 106 [2018-04-11 21:00:18,778 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 28 xjuncts. [2018-04-11 21:00:19,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:19,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 140 [2018-04-11 21:00:19,888 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 21:00:19,892 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 24 xjuncts. [2018-04-11 21:00:21,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2018-04-11 21:00:21,751 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 21:00:22,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:22,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:22,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:22,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:22,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 115 [2018-04-11 21:00:22,648 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-04-11 21:00:23,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:23,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 69 [2018-04-11 21:00:23,662 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-11 21:00:23,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:23,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:23,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:23,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 61 [2018-04-11 21:00:23,671 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 21:00:24,662 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 45 treesize of output 35 [2018-04-11 21:00:24,662 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:24,664 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 41 [2018-04-11 21:00:24,664 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:25,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:25,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:25,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:25,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 76 [2018-04-11 21:00:25,496 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-11 21:00:26,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2018-04-11 21:00:26,326 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:26,328 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 54 treesize of output 46 [2018-04-11 21:00:26,329 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:28,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:28,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 136 [2018-04-11 21:00:28,728 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 21:00:28,732 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 24 xjuncts. [2018-04-11 21:00:29,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:29,535 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 84 [2018-04-11 21:00:29,536 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 3 xjuncts. [2018-04-11 21:00:30,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 66 [2018-04-11 21:00:30,178 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-11 21:00:30,808 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 57 treesize of output 49 [2018-04-11 21:00:30,809 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:30,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-04-11 21:00:30,846 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:31,464 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 52 treesize of output 50 [2018-04-11 21:00:31,464 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:31,466 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 44 [2018-04-11 21:00:31,467 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:32,048 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:32,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:32,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:32,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 61 [2018-04-11 21:00:32,054 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-11 21:00:32,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:32,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 69 [2018-04-11 21:00:32,063 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-04-11 21:00:32,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:32,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 107 [2018-04-11 21:00:32,603 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 3 xjuncts. [2018-04-11 21:00:34,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:34,172 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 88 [2018-04-11 21:00:34,173 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 3 xjuncts. [2018-04-11 21:00:34,701 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 67 treesize of output 60 [2018-04-11 21:00:34,702 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:34,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2018-04-11 21:00:34,704 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:35,694 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 67 treesize of output 60 [2018-04-11 21:00:35,694 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:37,161 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 60 treesize of output 50 [2018-04-11 21:00:37,161 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:37,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:37,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 102 [2018-04-11 21:00:37,680 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 30 xjuncts. [2018-04-11 21:00:40,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:40,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:40,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:40,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 98 [2018-04-11 21:00:40,995 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 8 xjuncts. [2018-04-11 21:00:43,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-04-11 21:00:43,172 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:44,244 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 60 treesize of output 50 [2018-04-11 21:00:44,245 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:44,761 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 80 treesize of output 75 [2018-04-11 21:00:44,761 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:44,763 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 84 [2018-04-11 21:00:44,763 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:44,765 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 87 treesize of output 85 [2018-04-11 21:00:44,766 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:44,767 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 65 treesize of output 60 [2018-04-11 21:00:44,768 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:44,769 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 21:00:44,770 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:45,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:45,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 60 [2018-04-11 21:00:45,241 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-04-11 21:00:46,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:46,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:46,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00: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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 94 [2018-04-11 21:00:46,160 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 8 xjuncts. [2018-04-11 21:00:46,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:46,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:46,691 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 61 treesize of output 55 [2018-04-11 21:00:46,691 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:46,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-04-11 21:00:46,693 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:46,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 64 [2018-04-11 21:00:46,695 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:46,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:46,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:00:46,698 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 55 treesize of output 49 [2018-04-11 21:00:46,699 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:46,700 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 68 treesize of output 65 [2018-04-11 21:00:46,701 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:48,078 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 65 treesize of output 55 [2018-04-11 21:00:48,079 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:48,602 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 55 treesize of output 50 [2018-04-11 21:00:48,602 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:48,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 57 dim-1 vars, End of recursive call: and 20 xjuncts. [2018-04-11 21:00:49,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-11 21:00:49,086 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 8 variables, input treesize:86, output treesize:283 [2018-04-11 21:00:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 11 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:00:49,339 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 21:00:53,132 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 55 treesize of output 67 [2018-04-11 21:00:53,395 WARN L151 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 177 DAG size of output 141 [2018-04-11 21:00:53,398 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 51 treesize of output 43 [2018-04-11 21:00:53,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:00:53,530 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:00:53,537 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2018-04-11 21:00:53,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 21:00:53,644 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:00:53,660 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 64 [2018-04-11 21:00:53,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-11 21:00:53,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:00:53,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:00:53,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:62 [2018-04-11 21:00:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:00:54,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:00:54,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 63 [2018-04-11 21:00:54,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-11 21:00:54,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-11 21:00:54,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=3734, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 21:00:54,043 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand 64 states. [2018-04-11 21:00:56,905 WARN L151 SmtUtils]: Spent 2068ms on a formula simplification. DAG size of input: 101 DAG size of output 71 [2018-04-11 21:00:57,170 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 130 DAG size of output 111 [2018-04-11 21:00:57,500 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 134 DAG size of output 115 [2018-04-11 21:00:57,884 WARN L151 SmtUtils]: Spent 253ms on a formula simplification. DAG size of input: 138 DAG size of output 119 [2018-04-11 21:00:58,190 WARN L151 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 132 DAG size of output 113 [2018-04-11 21:00:58,591 WARN L151 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 141 DAG size of output 122 [2018-04-11 21:00:58,979 WARN L151 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 148 DAG size of output 111 [2018-04-11 21:00:59,378 WARN L151 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 152 DAG size of output 114 [2018-04-11 21:00:59,614 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 123 DAG size of output 91 [2018-04-11 21:00:59,959 WARN L151 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 156 DAG size of output 118 [2018-04-11 21:01:00,300 WARN L151 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 151 DAG size of output 114 [2018-04-11 21:01:00,780 WARN L151 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 143 DAG size of output 107 [2018-04-11 21:01:01,131 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 134 DAG size of output 98 [2018-04-11 21:01:01,478 WARN L151 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 143 DAG size of output 117 [2018-04-11 21:01:01,948 WARN L151 SmtUtils]: Spent 330ms on a formula simplification. DAG size of input: 148 DAG size of output 108 [2018-04-11 21:01:02,243 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 140 DAG size of output 121 [2018-04-11 21:01:02,583 WARN L151 SmtUtils]: Spent 187ms on a formula simplification. DAG size of input: 123 DAG size of output 94 [2018-04-11 21:01:02,862 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 120 DAG size of output 101 [2018-04-11 21:01:03,108 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 109 DAG size of output 84 [2018-04-11 21:01:03,392 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 124 DAG size of output 105 [2018-04-11 21:01:03,624 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 111 DAG size of output 86 [2018-04-11 21:01:04,008 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 130 DAG size of output 111 [2018-04-11 21:01:04,292 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 122 DAG size of output 103 [2018-04-11 21:01:04,619 WARN L151 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 127 DAG size of output 108 [2018-04-11 21:01:04,887 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-04-11 21:01:05,171 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 134 DAG size of output 101 [2018-04-11 21:01:05,489 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 138 DAG size of output 104 [2018-04-11 21:01:05,695 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 110 DAG size of output 78 [2018-04-11 21:01:06,006 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 152 DAG size of output 112 [2018-04-11 21:01:06,529 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 147 DAG size of output 108 [2018-04-11 21:01:07,906 WARN L151 SmtUtils]: Spent 1271ms on a formula simplification. DAG size of input: 85 DAG size of output 73 [2018-04-11 21:01:08,391 WARN L151 SmtUtils]: Spent 370ms on a formula simplification. DAG size of input: 85 DAG size of output 70 [2018-04-11 21:01:08,673 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 129 DAG size of output 97 [2018-04-11 21:01:08,998 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 89 DAG size of output 74 [2018-04-11 21:01:09,319 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 124 DAG size of output 93 [2018-04-11 21:01:10,272 WARN L151 SmtUtils]: Spent 830ms on a formula simplification. DAG size of input: 92 DAG size of output 77 [2018-04-11 21:01:10,784 WARN L151 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 105 DAG size of output 93 [2018-04-11 21:01:11,098 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 108 DAG size of output 80 [2018-04-11 21:01:11,444 WARN L151 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 106 DAG size of output 78 [2018-04-11 21:01:11,876 WARN L151 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 103 DAG size of output 91 [2018-04-11 21:01:12,083 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 117 DAG size of output 85 [2018-04-11 21:01:12,468 WARN L151 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 138 DAG size of output 103 [2018-04-11 21:01:12,857 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 104 DAG size of output 76 [2018-04-11 21:01:13,265 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 101 DAG size of output 89 [2018-04-11 21:01:13,667 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 114 DAG size of output 85 [2018-04-11 21:01:14,092 WARN L151 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 102 DAG size of output 78 [2018-04-11 21:01:14,551 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 86 DAG size of output 74 [2018-04-11 21:01:15,563 WARN L151 SmtUtils]: Spent 530ms on a formula simplification. DAG size of input: 82 DAG size of output 70 [2018-04-11 21:01:17,850 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 82 DAG size of output 70 [2018-04-11 21:01:22,067 WARN L151 SmtUtils]: Spent 440ms on a formula simplification. DAG size of input: 102 DAG size of output 86 [2018-04-11 21:01:22,432 WARN L151 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 92 DAG size of output 76 [2018-04-11 21:01:23,042 WARN L151 SmtUtils]: Spent 354ms on a formula simplification. DAG size of input: 103 DAG size of output 87 [2018-04-11 21:01:23,443 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 90 DAG size of output 74 [2018-04-11 21:01:23,720 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 83 DAG size of output 71 [2018-04-11 21:01:24,525 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 76 DAG size of output 64 [2018-04-11 21:01:25,275 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 129 DAG size of output 97 [2018-04-11 21:01:28,185 WARN L151 SmtUtils]: Spent 2572ms on a formula simplification. DAG size of input: 96 DAG size of output 84 [2018-04-11 21:01:28,778 WARN L151 SmtUtils]: Spent 456ms on a formula simplification. DAG size of input: 96 DAG size of output 81 [2018-04-11 21:01:29,467 WARN L151 SmtUtils]: Spent 545ms on a formula simplification. DAG size of input: 100 DAG size of output 85 [2018-04-11 21:01:30,228 WARN L151 SmtUtils]: Spent 527ms on a formula simplification. DAG size of input: 114 DAG size of output 88 [2018-04-11 21:01:31,480 WARN L151 SmtUtils]: Spent 924ms on a formula simplification. DAG size of input: 130 DAG size of output 106 [2018-04-11 21:01:32,467 WARN L151 SmtUtils]: Spent 498ms on a formula simplification. DAG size of input: 130 DAG size of output 92 [2018-04-11 21:01:33,684 WARN L151 SmtUtils]: Spent 814ms on a formula simplification. DAG size of input: 129 DAG size of output 90 [2018-04-11 21:01:35,793 WARN L151 SmtUtils]: Spent 1123ms on a formula simplification. DAG size of input: 122 DAG size of output 104 [2018-04-11 21:01:36,696 WARN L151 SmtUtils]: Spent 510ms on a formula simplification. DAG size of input: 121 DAG size of output 87 [2018-04-11 21:01:38,822 WARN L151 SmtUtils]: Spent 481ms on a formula simplification. DAG size of input: 127 DAG size of output 88 [2018-04-11 21:01:40,952 WARN L151 SmtUtils]: Spent 509ms on a formula simplification. DAG size of input: 120 DAG size of output 102 [2018-04-11 21:01:42,208 WARN L151 SmtUtils]: Spent 608ms on a formula simplification. DAG size of input: 74 DAG size of output 62 [2018-04-11 21:01:43,391 WARN L151 SmtUtils]: Spent 470ms on a formula simplification. DAG size of input: 109 DAG size of output 86 [2018-04-11 21:01:47,266 WARN L151 SmtUtils]: Spent 568ms on a formula simplification. DAG size of input: 93 DAG size of output 81 [2018-04-11 21:01:49,523 WARN L151 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 60 DAG size of output 52 [2018-04-11 21:01:50,818 WARN L151 SmtUtils]: Spent 716ms on a formula simplification. DAG size of input: 98 DAG size of output 82 [2018-04-11 21:01:54,275 WARN L151 SmtUtils]: Spent 2252ms on a formula simplification. DAG size of input: 89 DAG size of output 77 [2018-04-11 21:01:54,930 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 62 DAG size of output 54 Received shutdown request... [2018-04-11 21:01:55,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-11 21:01:55,225 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 21:01:55,228 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 21:01:55,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 09:01:55 BoogieIcfgContainer [2018-04-11 21:01:55,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 21:01:55,229 INFO L168 Benchmark]: Toolchain (without parser) took 262718.94 ms. Allocated memory was 303.0 MB in the beginning and 398.5 MB in the end (delta: 95.4 MB). Free memory was 240.2 MB in the beginning and 284.7 MB in the end (delta: -44.6 MB). Peak memory consumption was 50.9 MB. Max. memory is 5.3 GB. [2018-04-11 21:01:55,230 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 303.0 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 21:01:55,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.09 ms. Allocated memory is still 303.0 MB. Free memory was 240.2 MB in the beginning and 216.2 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-11 21:01:55,230 INFO L168 Benchmark]: Boogie Preprocessor took 57.67 ms. Allocated memory is still 303.0 MB. Free memory was 216.2 MB in the beginning and 214.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-11 21:01:55,230 INFO L168 Benchmark]: RCFGBuilder took 580.67 ms. Allocated memory was 303.0 MB in the beginning and 459.3 MB in the end (delta: 156.2 MB). Free memory was 213.2 MB in the beginning and 392.4 MB in the end (delta: -179.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-04-11 21:01:55,231 INFO L168 Benchmark]: TraceAbstraction took 261740.20 ms. Allocated memory was 459.3 MB in the beginning and 398.5 MB in the end (delta: -60.8 MB). Free memory was 391.0 MB in the beginning and 284.7 MB in the end (delta: 106.3 MB). Peak memory consumption was 45.4 MB. Max. memory is 5.3 GB. [2018-04-11 21:01:55,232 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 303.0 MB. Free memory is still 265.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 336.09 ms. Allocated memory is still 303.0 MB. Free memory was 240.2 MB in the beginning and 216.2 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 57.67 ms. Allocated memory is still 303.0 MB. Free memory was 216.2 MB in the beginning and 214.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 580.67 ms. Allocated memory was 303.0 MB in the beginning and 459.3 MB in the end (delta: 156.2 MB). Free memory was 213.2 MB in the beginning and 392.4 MB in the end (delta: -179.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 261740.20 ms. Allocated memory was 459.3 MB in the beginning and 398.5 MB in the end (delta: -60.8 MB). Free memory was 391.0 MB in the beginning and 284.7 MB in the end (delta: 106.3 MB). Peak memory consumption was 45.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 566]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 550]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 543]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and interpolant automaton (currently 92 states, 64 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 152 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 102 locations, 15 error locations. TIMEOUT Result, 261.6s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 155.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2163 SDtfs, 7710 SDslu, 13546 SDs, 0 SdLazy, 9566 SolverSat, 416 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2791 GetRequests, 1973 SyntacticMatches, 27 SemanticMatches, 790 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 12583 ImplicationChecksByTransitivity, 160.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=12, 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, 721 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 104.7s InterpolantComputationTime, 1216 NumberOfCodeBlocks, 1216 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2378 ConstructedInterpolants, 500 QuantifiedInterpolants, 2492113 SizeOfPredicates, 344 NumberOfNonLiveVariables, 3803 ConjunctsInSsa, 598 ConjunctsInUnsatCore, 54 InterpolantComputations, 38 PerfectInterpolantSequences, 50/376 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/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_21-01-55-239.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_21-01-55-239.csv Completed graceful shutdown