java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 10:50:42,875 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 10:50:42,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 10:50:42,885 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 10:50:42,885 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 10:50:42,886 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 10:50:42,887 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 10:50:42,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 10:50:42,890 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 10:50:42,891 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 10:50:42,892 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 10:50:42,892 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 10:50:42,893 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 10:50:42,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 10:50:42,894 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 10:50:42,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 10:50:42,898 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 10:50:42,899 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 10:50:42,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 10:50:42,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 10:50:42,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 10:50:42,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 10:50:42,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 10:50:42,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 10:50:42,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 10:50:42,906 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 10:50:42,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 10:50:42,907 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 10:50:42,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 10:50:42,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 10:50:42,908 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 10:50:42,909 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 10:50:42,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 10:50:42,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 10:50:42,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 10:50:42,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 10:50:42,931 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 10:50:42,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 10:50:42,931 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 10:50:42,931 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 10:50:42,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 10:50:42,932 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 10:50:42,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 10:50:42,932 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 10:50:42,932 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 10:50:42,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 10:50:42,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 10:50:42,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 10:50:42,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 10:50:42,933 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 10:50:42,933 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 10:50:42,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 10:50:42,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 10:50:42,934 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 10:50:42,934 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 10:50:42,934 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 10:50:42,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 10:50:42,977 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 10:50:42,980 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 10:50:42,981 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 10:50:42,981 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 10:50:42,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,309 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG80816901d [2018-04-11 10:50:43,450 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 10:50:43,451 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 10:50:43,451 INFO L168 CDTParser]: Scanning tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,457 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 10:50:43,457 INFO L215 ultiparseSymbolTable]: [2018-04-11 10:50:43,458 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 10:50:43,458 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,458 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 10:50:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsfilcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ino_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__TreeNode in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__gid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__off_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsfilcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,458 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blkcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ldiv_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ssize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__timer_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____socklen_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__register_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____nlink_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_mutex_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____rlim_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsblkcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____swblk_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____time_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____suseconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsblkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,459 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____timer_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____rlim64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsfilcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_mutexattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__wchar_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_condattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fd_set in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____clockid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_attr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____caddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,460 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____dev_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__mode_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__lldiv_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__uid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__suseconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____sigset_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_short in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__size_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ulong in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,461 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_cond_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_once_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____intptr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__div_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_long in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__blksize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_spinlock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_short in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__caddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____mode_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ino_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,462 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__clock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__daddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_rwlockattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_long in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_char in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_barrier_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____off_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,463 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__blkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ListNode in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____pthread_list_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_barrierattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____loff_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____WAIT_STATUS in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ushort in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,464 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____clock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_char in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blksize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____gid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____off64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____pid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____qaddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,465 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____daddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__loff_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__id_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__uint in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_rwlock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_int in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____useconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__dev_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__nlink_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fd_mask in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____id_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,466 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__time_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__clockid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsblkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____sig_atomic_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fd_mask in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ssize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ino64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,467 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__sigset_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:43,600 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG80816901d [2018-04-11 10:50:43,603 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 10:50:43,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 10:50:43,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 10:50:43,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 10:50:43,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 10:50:43,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:50:43" (1/1) ... [2018-04-11 10:50:43,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36cd6f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43, skipping insertion in model container [2018-04-11 10:50:43,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:50:43" (1/1) ... [2018-04-11 10:50:43,624 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:50:43,648 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:50:43,794 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:50:43,841 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:50:43,847 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 10:50:43,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43 WrapperNode [2018-04-11 10:50:43,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 10:50:43,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 10:50:43,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 10:50:43,885 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 10:50:43,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43" (1/1) ... [2018-04-11 10:50:43,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43" (1/1) ... [2018-04-11 10:50:43,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43" (1/1) ... [2018-04-11 10:50:43,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43" (1/1) ... [2018-04-11 10:50:43,925 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43" (1/1) ... [2018-04-11 10:50:43,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43" (1/1) ... [2018-04-11 10:50:43,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43" (1/1) ... [2018-04-11 10:50:43,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 10:50:43,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 10:50:43,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 10:50:43,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 10:50:43,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 10:50:44,036 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 10:50:44,037 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 10:50:44,037 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 10:50:44,037 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 10:50:44,037 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 10:50:44,037 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 10:50:44,037 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 10:50:44,037 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 10:50:44,037 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 10:50:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 10:50:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 10:50:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 10:50:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 10:50:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 10:50:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 10:50:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 10:50:44,038 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 10:50:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 10:50:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 10:50:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 10:50:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 10:50:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 10:50:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 10:50:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 10:50:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 10:50:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 10:50:44,039 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 10:50:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 10:50:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 10:50:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 10:50:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 10:50:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 10:50:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 10:50:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 10:50:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 10:50:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 10:50:44,040 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 10:50:44,041 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 10:50:44,042 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 10:50:44,042 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 10:50:44,042 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 10:50:44,042 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 10:50:44,042 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 10:50:44,042 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 10:50:44,042 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 10:50:44,042 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 10:50:44,042 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 10:50:44,043 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 10:50:44,043 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 10:50:44,043 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 10:50:44,043 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 10:50:44,043 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 10:50:44,043 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 10:50:44,043 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 10:50:44,043 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 10:50:44,043 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 10:50:44,044 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 10:50:44,045 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 10:50:44,046 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 10:50:44,047 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 10:50:44,047 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 10:50:44,047 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 10:50:44,047 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 10:50:44,047 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 10:50:44,047 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 10:50:44,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 10:50:44,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 10:50:44,047 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 10:50:44,571 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 10:50:44,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:50:44 BoogieIcfgContainer [2018-04-11 10:50:44,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 10:50:44,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 10:50:44,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 10:50:44,574 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 10:50:44,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 10:50:43" (1/3) ... [2018-04-11 10:50:44,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cde4441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:50:44, skipping insertion in model container [2018-04-11 10:50:44,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:50:43" (2/3) ... [2018-04-11 10:50:44,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cde4441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:50:44, skipping insertion in model container [2018-04-11 10:50:44,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:50:44" (3/3) ... [2018-04-11 10:50:44,576 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-04-11 10:50:44,584 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 10:50:44,590 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-04-11 10:50:44,614 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 10:50:44,614 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 10:50:44,614 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 10:50:44,614 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 10:50:44,614 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 10:50:44,614 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 10:50:44,614 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 10:50:44,614 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 10:50:44,614 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 10:50:44,615 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 10:50:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states. [2018-04-11 10:50:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 10:50:44,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:44,635 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:44,635 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash 268960233, now seen corresponding path program 1 times [2018-04-11 10:50:44,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:44,640 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:44,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:44,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:44,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:44,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:44,736 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 10:50:44,737 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:44,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:50:44,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:50:44,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:50:44,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:50:44,748 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 4 states. [2018-04-11 10:50:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:45,094 INFO L93 Difference]: Finished difference Result 339 states and 363 transitions. [2018-04-11 10:50:45,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:50:45,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 10:50:45,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:45,103 INFO L225 Difference]: With dead ends: 339 [2018-04-11 10:50:45,103 INFO L226 Difference]: Without dead ends: 335 [2018-04-11 10:50:45,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:50:45,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-11 10:50:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 214. [2018-04-11 10:50:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-11 10:50:45,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 230 transitions. [2018-04-11 10:50:45,137 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 230 transitions. Word has length 8 [2018-04-11 10:50:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:45,137 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 230 transitions. [2018-04-11 10:50:45,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:50:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 230 transitions. [2018-04-11 10:50:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 10:50:45,138 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:45,138 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:45,138 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:45,138 INFO L82 PathProgramCache]: Analyzing trace with hash 268960234, now seen corresponding path program 1 times [2018-04-11 10:50:45,138 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:45,138 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:45,139 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:45,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:45,139 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:45,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:45,188 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 10:50:45,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:45,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:50:45,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:50:45,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:50:45,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:50:45,191 INFO L87 Difference]: Start difference. First operand 214 states and 230 transitions. Second operand 4 states. [2018-04-11 10:50:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:45,381 INFO L93 Difference]: Finished difference Result 212 states and 228 transitions. [2018-04-11 10:50:45,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:50:45,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 10:50:45,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:45,383 INFO L225 Difference]: With dead ends: 212 [2018-04-11 10:50:45,383 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 10:50:45,384 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:50:45,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 10:50:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-04-11 10:50:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-11 10:50:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 228 transitions. [2018-04-11 10:50:45,392 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 228 transitions. Word has length 8 [2018-04-11 10:50:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:45,393 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 228 transitions. [2018-04-11 10:50:45,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:50:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 228 transitions. [2018-04-11 10:50:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 10:50:45,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:45,393 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:45,393 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:45,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1814695774, now seen corresponding path program 1 times [2018-04-11 10:50:45,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:45,394 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:45,395 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:45,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:45,395 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:45,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:45,455 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 10:50:45,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:45,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:50:45,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:50:45,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:50:45,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:50:45,456 INFO L87 Difference]: Start difference. First operand 212 states and 228 transitions. Second operand 5 states. [2018-04-11 10:50:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:45,720 INFO L93 Difference]: Finished difference Result 371 states and 399 transitions. [2018-04-11 10:50:45,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:50:45,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-04-11 10:50:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:45,721 INFO L225 Difference]: With dead ends: 371 [2018-04-11 10:50:45,722 INFO L226 Difference]: Without dead ends: 371 [2018-04-11 10:50:45,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:50:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-11 10:50:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 205. [2018-04-11 10:50:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 10:50:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 221 transitions. [2018-04-11 10:50:45,730 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 221 transitions. Word has length 11 [2018-04-11 10:50:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:45,731 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 221 transitions. [2018-04-11 10:50:45,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:50:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 221 transitions. [2018-04-11 10:50:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 10:50:45,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:45,732 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:45,732 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:45,732 INFO L82 PathProgramCache]: Analyzing trace with hash -848494062, now seen corresponding path program 1 times [2018-04-11 10:50:45,732 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:45,732 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:45,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:45,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:45,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:45,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:45,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 10:50:45,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:45,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:50:45,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:50:45,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:50:45,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:50:45,768 INFO L87 Difference]: Start difference. First operand 205 states and 221 transitions. Second operand 5 states. [2018-04-11 10:50:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:45,968 INFO L93 Difference]: Finished difference Result 284 states and 306 transitions. [2018-04-11 10:50:45,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:50:45,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 10:50:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:45,970 INFO L225 Difference]: With dead ends: 284 [2018-04-11 10:50:45,970 INFO L226 Difference]: Without dead ends: 284 [2018-04-11 10:50:45,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:50:45,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-11 10:50:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 204. [2018-04-11 10:50:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 10:50:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2018-04-11 10:50:45,975 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 14 [2018-04-11 10:50:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:45,976 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2018-04-11 10:50:45,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:50:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2018-04-11 10:50:45,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 10:50:45,976 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:45,976 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:45,976 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash -848494061, now seen corresponding path program 1 times [2018-04-11 10:50:45,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:45,977 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:45,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:45,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:45,977 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:45,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:50:46,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:46,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:50:46,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:50:46,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:50:46,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:50:46,031 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand 5 states. [2018-04-11 10:50:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:46,206 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2018-04-11 10:50:46,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:50:46,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 10:50:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:46,208 INFO L225 Difference]: With dead ends: 327 [2018-04-11 10:50:46,208 INFO L226 Difference]: Without dead ends: 327 [2018-04-11 10:50:46,208 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:50:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-11 10:50:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 203. [2018-04-11 10:50:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 10:50:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 219 transitions. [2018-04-11 10:50:46,214 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 219 transitions. Word has length 14 [2018-04-11 10:50:46,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:46,214 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 219 transitions. [2018-04-11 10:50:46,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:50:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 219 transitions. [2018-04-11 10:50:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 10:50:46,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:46,215 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:46,215 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:46,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1899641121, now seen corresponding path program 1 times [2018-04-11 10:50:46,215 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:46,215 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:46,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:46,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:46,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:46,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:46,348 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 10:50:46,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:46,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 10:50:46,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 10:50:46,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 10:50:46,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:50:46,349 INFO L87 Difference]: Start difference. First operand 203 states and 219 transitions. Second operand 8 states. [2018-04-11 10:50:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:46,832 INFO L93 Difference]: Finished difference Result 379 states and 415 transitions. [2018-04-11 10:50:46,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 10:50:46,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-11 10:50:46,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:46,834 INFO L225 Difference]: With dead ends: 379 [2018-04-11 10:50:46,834 INFO L226 Difference]: Without dead ends: 379 [2018-04-11 10:50:46,834 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 10:50:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-11 10:50:46,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 210. [2018-04-11 10:50:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 10:50:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2018-04-11 10:50:46,839 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 22 [2018-04-11 10:50:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:46,840 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2018-04-11 10:50:46,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 10:50:46,840 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2018-04-11 10:50:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 10:50:46,840 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:46,842 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:46,842 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:46,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1899641120, now seen corresponding path program 1 times [2018-04-11 10:50:46,843 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:46,843 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:46,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:46,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:46,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:46,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:46,951 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 10:50:46,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:46,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 10:50:46,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 10:50:46,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 10:50:46,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:50:46,952 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 8 states. [2018-04-11 10:50:47,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:47,441 INFO L93 Difference]: Finished difference Result 575 states and 631 transitions. [2018-04-11 10:50:47,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 10:50:47,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-11 10:50:47,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:47,443 INFO L225 Difference]: With dead ends: 575 [2018-04-11 10:50:47,443 INFO L226 Difference]: Without dead ends: 575 [2018-04-11 10:50:47,443 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 10:50:47,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-11 10:50:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 210. [2018-04-11 10:50:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 10:50:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-04-11 10:50:47,446 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 22 [2018-04-11 10:50:47,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:47,447 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2018-04-11 10:50:47,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 10:50:47,447 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2018-04-11 10:50:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 10:50:47,447 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:47,447 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:47,447 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:47,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1206347211, now seen corresponding path program 1 times [2018-04-11 10:50:47,447 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:47,448 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:47,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:47,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:47,448 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:47,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:47,474 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 10:50:47,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:47,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:50:47,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:50:47,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:50:47,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:50:47,474 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand 4 states. [2018-04-11 10:50:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:47,597 INFO L93 Difference]: Finished difference Result 283 states and 307 transitions. [2018-04-11 10:50:47,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:50:47,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 10:50:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:47,598 INFO L225 Difference]: With dead ends: 283 [2018-04-11 10:50:47,598 INFO L226 Difference]: Without dead ends: 283 [2018-04-11 10:50:47,599 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:50:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-11 10:50:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 203. [2018-04-11 10:50:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 10:50:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2018-04-11 10:50:47,603 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 23 [2018-04-11 10:50:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:47,604 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2018-04-11 10:50:47,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:50:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2018-04-11 10:50:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 10:50:47,604 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:47,604 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:47,605 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1206347212, now seen corresponding path program 1 times [2018-04-11 10:50:47,605 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:47,605 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:47,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:47,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:47,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:47,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:47,665 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 10:50:47,665 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:47,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:50:47,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:50:47,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:50:47,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:50:47,665 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand 6 states. [2018-04-11 10:50:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:47,891 INFO L93 Difference]: Finished difference Result 488 states and 542 transitions. [2018-04-11 10:50:47,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:50:47,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-04-11 10:50:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:47,892 INFO L225 Difference]: With dead ends: 488 [2018-04-11 10:50:47,892 INFO L226 Difference]: Without dead ends: 488 [2018-04-11 10:50:47,893 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:50:47,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-04-11 10:50:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 366. [2018-04-11 10:50:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-04-11 10:50:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 491 transitions. [2018-04-11 10:50:47,901 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 491 transitions. Word has length 23 [2018-04-11 10:50:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:47,901 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 491 transitions. [2018-04-11 10:50:47,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:50:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 491 transitions. [2018-04-11 10:50:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 10:50:47,902 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:47,902 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:47,902 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:47,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1240667406, now seen corresponding path program 1 times [2018-04-11 10:50:47,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:47,902 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:47,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:47,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:47,903 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:47,911 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:47,929 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 10:50:47,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:47,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:50:47,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:50:47,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:50:47,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:50:47,930 INFO L87 Difference]: Start difference. First operand 366 states and 491 transitions. Second operand 4 states. [2018-04-11 10:50:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:48,163 INFO L93 Difference]: Finished difference Result 906 states and 1231 transitions. [2018-04-11 10:50:48,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:50:48,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 10:50:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:48,166 INFO L225 Difference]: With dead ends: 906 [2018-04-11 10:50:48,166 INFO L226 Difference]: Without dead ends: 906 [2018-04-11 10:50:48,166 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:50:48,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-04-11 10:50:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 364. [2018-04-11 10:50:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-11 10:50:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 486 transitions. [2018-04-11 10:50:48,176 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 486 transitions. Word has length 23 [2018-04-11 10:50:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:48,176 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 486 transitions. [2018-04-11 10:50:48,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:50:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 486 transitions. [2018-04-11 10:50:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 10:50:48,177 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:48,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] [2018-04-11 10:50:48,177 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:48,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1240667407, now seen corresponding path program 1 times [2018-04-11 10:50:48,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:48,178 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:48,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:48,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:48,178 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:48,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:48,212 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 10:50:48,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:48,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:50:48,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:50:48,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:50:48,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:50:48,213 INFO L87 Difference]: Start difference. First operand 364 states and 486 transitions. Second operand 4 states. [2018-04-11 10:50:48,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:48,429 INFO L93 Difference]: Finished difference Result 750 states and 1035 transitions. [2018-04-11 10:50:48,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:50:48,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 10:50:48,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:48,431 INFO L225 Difference]: With dead ends: 750 [2018-04-11 10:50:48,432 INFO L226 Difference]: Without dead ends: 750 [2018-04-11 10:50:48,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:50:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-04-11 10:50:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 363. [2018-04-11 10:50:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-11 10:50:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 485 transitions. [2018-04-11 10:50:48,440 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 485 transitions. Word has length 23 [2018-04-11 10:50:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:48,440 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 485 transitions. [2018-04-11 10:50:48,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:50:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 485 transitions. [2018-04-11 10:50:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 10:50:48,441 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:48,441 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:48,441 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:48,441 INFO L82 PathProgramCache]: Analyzing trace with hash -339091572, now seen corresponding path program 1 times [2018-04-11 10:50:48,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:48,441 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:48,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:48,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:48,442 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:48,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:48,464 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 10:50:48,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:48,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:50:48,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:50:48,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:50:48,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:50:48,465 INFO L87 Difference]: Start difference. First operand 363 states and 485 transitions. Second operand 4 states. [2018-04-11 10:50:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:48,486 INFO L93 Difference]: Finished difference Result 439 states and 565 transitions. [2018-04-11 10:50:48,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:50:48,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-11 10:50:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:48,489 INFO L225 Difference]: With dead ends: 439 [2018-04-11 10:50:48,489 INFO L226 Difference]: Without dead ends: 439 [2018-04-11 10:50:48,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:50:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-11 10:50:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 408. [2018-04-11 10:50:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-11 10:50:48,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 565 transitions. [2018-04-11 10:50:48,496 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 565 transitions. Word has length 25 [2018-04-11 10:50:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:48,496 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 565 transitions. [2018-04-11 10:50:48,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:50:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 565 transitions. [2018-04-11 10:50:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 10:50:48,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:48,497 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 10:50:48,497 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1765841307, now seen corresponding path program 1 times [2018-04-11 10:50:48,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:48,497 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:48,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:48,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:48,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:48,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:50:48,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:48,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:50:48,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:50:48,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:50:48,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:50:48,570 INFO L87 Difference]: Start difference. First operand 408 states and 565 transitions. Second operand 9 states. [2018-04-11 10:50:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:49,195 INFO L93 Difference]: Finished difference Result 1333 states and 1860 transitions. [2018-04-11 10:50:49,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 10:50:49,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-11 10:50:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:49,200 INFO L225 Difference]: With dead ends: 1333 [2018-04-11 10:50:49,200 INFO L226 Difference]: Without dead ends: 1333 [2018-04-11 10:50:49,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-04-11 10:50:49,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2018-04-11 10:50:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 407. [2018-04-11 10:50:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-04-11 10:50:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 564 transitions. [2018-04-11 10:50:49,211 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 564 transitions. Word has length 26 [2018-04-11 10:50:49,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:49,211 INFO L459 AbstractCegarLoop]: Abstraction has 407 states and 564 transitions. [2018-04-11 10:50:49,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:50:49,211 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 564 transitions. [2018-04-11 10:50:49,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 10:50:49,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:49,212 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 10:50:49,212 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:49,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1765841306, now seen corresponding path program 1 times [2018-04-11 10:50:49,212 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:49,212 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:49,213 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:49,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:49,213 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:49,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:49,295 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 10:50:49,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:49,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:50:49,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:50:49,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:50:49,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:50:49,296 INFO L87 Difference]: Start difference. First operand 407 states and 564 transitions. Second operand 9 states. [2018-04-11 10:50:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:49,905 INFO L93 Difference]: Finished difference Result 1332 states and 1859 transitions. [2018-04-11 10:50:49,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 10:50:49,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-11 10:50:49,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:49,909 INFO L225 Difference]: With dead ends: 1332 [2018-04-11 10:50:49,909 INFO L226 Difference]: Without dead ends: 1332 [2018-04-11 10:50:49,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-04-11 10:50:49,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-04-11 10:50:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 406. [2018-04-11 10:50:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-04-11 10:50:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 563 transitions. [2018-04-11 10:50:49,920 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 563 transitions. Word has length 26 [2018-04-11 10:50:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:49,920 INFO L459 AbstractCegarLoop]: Abstraction has 406 states and 563 transitions. [2018-04-11 10:50:49,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:50:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 563 transitions. [2018-04-11 10:50:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 10:50:49,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:49,921 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:49,921 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:49,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1476109501, now seen corresponding path program 1 times [2018-04-11 10:50:49,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:49,921 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:49,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:49,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:49,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:49,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:49,943 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 10:50:49,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:49,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:50:49,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 10:50:49,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 10:50:49,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:50:49,945 INFO L87 Difference]: Start difference. First operand 406 states and 563 transitions. Second operand 3 states. [2018-04-11 10:50:49,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:49,951 INFO L93 Difference]: Finished difference Result 410 states and 567 transitions. [2018-04-11 10:50:49,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 10:50:49,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-11 10:50:49,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:49,953 INFO L225 Difference]: With dead ends: 410 [2018-04-11 10:50:49,953 INFO L226 Difference]: Without dead ends: 410 [2018-04-11 10:50:49,953 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:50:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-11 10:50:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2018-04-11 10:50:49,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-11 10:50:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 567 transitions. [2018-04-11 10:50:49,960 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 567 transitions. Word has length 30 [2018-04-11 10:50:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:49,960 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 567 transitions. [2018-04-11 10:50:49,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 10:50:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 567 transitions. [2018-04-11 10:50:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 10:50:49,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:49,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] [2018-04-11 10:50:49,961 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash -664022590, now seen corresponding path program 1 times [2018-04-11 10:50:49,962 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:49,962 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:49,963 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:49,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:49,963 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:49,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:49,980 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 10:50:49,981 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:49,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:50:49,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 10:50:49,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 10:50:49,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:50:49,981 INFO L87 Difference]: Start difference. First operand 410 states and 567 transitions. Second operand 3 states. [2018-04-11 10:50:49,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:49,989 INFO L93 Difference]: Finished difference Result 413 states and 570 transitions. [2018-04-11 10:50:49,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 10:50:49,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-04-11 10:50:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:49,991 INFO L225 Difference]: With dead ends: 413 [2018-04-11 10:50:49,991 INFO L226 Difference]: Without dead ends: 413 [2018-04-11 10:50:49,991 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:50:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-11 10:50:49,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-04-11 10:50:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-11 10:50:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 570 transitions. [2018-04-11 10:50:49,997 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 570 transitions. Word has length 31 [2018-04-11 10:50:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:49,997 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 570 transitions. [2018-04-11 10:50:49,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 10:50:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 570 transitions. [2018-04-11 10:50:49,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 10:50:49,998 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:49,998 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 10:50:49,998 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:49,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1251934904, now seen corresponding path program 1 times [2018-04-11 10:50:49,999 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:49,999 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:49,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:49,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:50,000 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:50,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:50,024 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 10:50:50,024 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:50,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:50:50,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 10:50:50,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 10:50:50,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:50:50,025 INFO L87 Difference]: Start difference. First operand 413 states and 570 transitions. Second operand 3 states. [2018-04-11 10:50:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:50,039 INFO L93 Difference]: Finished difference Result 456 states and 601 transitions. [2018-04-11 10:50:50,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 10:50:50,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-04-11 10:50:50,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:50,041 INFO L225 Difference]: With dead ends: 456 [2018-04-11 10:50:50,041 INFO L226 Difference]: Without dead ends: 456 [2018-04-11 10:50:50,041 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:50:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-11 10:50:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 401. [2018-04-11 10:50:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-11 10:50:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 547 transitions. [2018-04-11 10:50:50,048 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 547 transitions. Word has length 32 [2018-04-11 10:50:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:50,048 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 547 transitions. [2018-04-11 10:50:50,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 10:50:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 547 transitions. [2018-04-11 10:50:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 10:50:50,049 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:50,049 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] [2018-04-11 10:50:50,049 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash -403555681, now seen corresponding path program 1 times [2018-04-11 10:50:50,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:50,049 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:50,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:50,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:50,050 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:50,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:50,173 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 10:50:50,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:50:50,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 10:50:50,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 10:50:50,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 10:50:50,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:50:50,174 INFO L87 Difference]: Start difference. First operand 401 states and 547 transitions. Second operand 10 states. [2018-04-11 10:50:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:50,571 INFO L93 Difference]: Finished difference Result 637 states and 808 transitions. [2018-04-11 10:50:50,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 10:50:50,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-04-11 10:50:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:50,572 INFO L225 Difference]: With dead ends: 637 [2018-04-11 10:50:50,572 INFO L226 Difference]: Without dead ends: 637 [2018-04-11 10:50:50,572 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-04-11 10:50:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-04-11 10:50:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 418. [2018-04-11 10:50:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-04-11 10:50:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 569 transitions. [2018-04-11 10:50:50,579 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 569 transitions. Word has length 33 [2018-04-11 10:50:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:50,579 INFO L459 AbstractCegarLoop]: Abstraction has 418 states and 569 transitions. [2018-04-11 10:50:50,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 10:50:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 569 transitions. [2018-04-11 10:50:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 10:50:50,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:50,580 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] [2018-04-11 10:50:50,580 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:50,580 INFO L82 PathProgramCache]: Analyzing trace with hash 932853160, now seen corresponding path program 1 times [2018-04-11 10:50:50,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:50,580 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:50,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:50,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:50,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:50,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:50,787 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 10:50:50,788 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:50:50,788 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:50:50,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:50,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:50:50,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:50:50,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:50:50,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:50,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:50,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:50:50,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:50:50,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:50,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:50,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:50,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 10:50:51,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:50:51,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:50:51,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:50:51,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:50:51,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-11 10:50:51,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,087 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 10:50:51,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-11 10:50:51,120 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 30 treesize of output 23 [2018-04-11 10:50:51,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 10:50:51,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,150 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 30 treesize of output 23 [2018-04-11 10:50:51,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 10:50:51,158 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:49 [2018-04-11 10:50:51,225 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 40 treesize of output 41 [2018-04-11 10:50:51,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:50:51,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-04-11 10:50:51,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:50:51,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,258 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:49 [2018-04-11 10:50:51,304 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 34 treesize of output 26 [2018-04-11 10:50:51,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,310 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-04-11 10:50:51,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 10:50:51,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:51,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 10:50:51,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:51,326 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:7 [2018-04-11 10:50:51,353 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 10:50:51,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 10:50:51,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 24 [2018-04-11 10:50:51,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 10:50:51,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 10:50:51,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-04-11 10:50:51,372 INFO L87 Difference]: Start difference. First operand 418 states and 569 transitions. Second operand 24 states. [2018-04-11 10:50:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:50:52,899 INFO L93 Difference]: Finished difference Result 635 states and 804 transitions. [2018-04-11 10:50:52,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 10:50:52,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-04-11 10:50:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:50:52,901 INFO L225 Difference]: With dead ends: 635 [2018-04-11 10:50:52,901 INFO L226 Difference]: Without dead ends: 635 [2018-04-11 10:50:52,901 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=1415, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 10:50:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-04-11 10:50:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 467. [2018-04-11 10:50:52,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-04-11 10:50:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 648 transitions. [2018-04-11 10:50:52,908 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 648 transitions. Word has length 34 [2018-04-11 10:50:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:50:52,909 INFO L459 AbstractCegarLoop]: Abstraction has 467 states and 648 transitions. [2018-04-11 10:50:52,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 10:50:52,909 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 648 transitions. [2018-04-11 10:50:52,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 10:50:52,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:50:52,909 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:50:52,909 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:50:52,909 INFO L82 PathProgramCache]: Analyzing trace with hash -536384940, now seen corresponding path program 1 times [2018-04-11 10:50:52,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:50:52,909 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:50:52,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:52,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:52,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:50:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:52,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:50:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:50:53,012 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:50:53,012 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:50:53,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:50:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:50:53,039 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:50:53,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:53,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:53,044 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 10:50:53,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 10:50:53,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:50:53,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:50:53,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 10:50:53,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 10:50:53,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:50:53,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,098 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 10:50:53,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:16 [2018-04-11 10:50:53,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:53,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:53,107 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 10:50:53,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 10:50:53,122 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 22 treesize of output 23 [2018-04-11 10:50:53,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:50:53,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,133 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 10:50:53,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2018-04-11 10:50:53,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 10:50:53,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:50:53,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:50:53,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-04-11 10:50:53,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:53,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:50:53,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-04-11 10:50:53,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,224 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 10:50:53,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:51 [2018-04-11 10:50:53,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2018-04-11 10:50:53,285 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 6 treesize of output 4 [2018-04-11 10:50:53,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-04-11 10:50:53,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:50:53,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:50:53,300 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:15 [2018-04-11 10:50:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:50:53,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:50:53,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-04-11 10:50:53,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 10:50:53,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 10:50:53,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-04-11 10:50:53,348 INFO L87 Difference]: Start difference. First operand 467 states and 648 transitions. Second operand 18 states. [2018-04-11 10:51:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:04,324 INFO L93 Difference]: Finished difference Result 788 states and 1022 transitions. [2018-04-11 10:51:04,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 10:51:04,324 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-04-11 10:51:04,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:04,326 INFO L225 Difference]: With dead ends: 788 [2018-04-11 10:51:04,326 INFO L226 Difference]: Without dead ends: 788 [2018-04-11 10:51:04,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-04-11 10:51:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-04-11 10:51:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 466. [2018-04-11 10:51:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-04-11 10:51:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 647 transitions. [2018-04-11 10:51:04,331 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 647 transitions. Word has length 34 [2018-04-11 10:51:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:04,331 INFO L459 AbstractCegarLoop]: Abstraction has 466 states and 647 transitions. [2018-04-11 10:51:04,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 10:51:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 647 transitions. [2018-04-11 10:51:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 10:51:04,332 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:04,332 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:04,332 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:04,332 INFO L82 PathProgramCache]: Analyzing trace with hash -536384939, now seen corresponding path program 1 times [2018-04-11 10:51:04,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:04,332 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:04,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:04,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:04,333 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:04,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:04,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:04,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:51:04,487 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:51:04,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:04,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:51:04,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:04,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:04,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:51:04,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 10:51:04,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:51:04,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:51:04,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 10:51:04,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 10:51:04,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:04,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,588 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 10:51:04,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:16 [2018-04-11 10:51:04,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:04,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:04,591 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 10:51:04,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 10:51:04,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-04-11 10:51:04,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:51:04,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2018-04-11 10:51:04,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:51:04,669 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,680 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2018-04-11 10:51:04,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2018-04-11 10:51:04,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:04,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2018-04-11 10:51:04,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:04,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,777 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:51:04,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:106, output treesize:80 [2018-04-11 10:51:04,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:04,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-04-11 10:51:04,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:04,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:04,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-04-11 10:51:04,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:04,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 10:51:04,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:84 [2018-04-11 10:51:05,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 58 [2018-04-11 10:51:05,005 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 6 treesize of output 4 [2018-04-11 10:51:05,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:05,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 29 [2018-04-11 10:51:05,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:05,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:05,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-11 10:51:05,028 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 26 treesize of output 11 [2018-04-11 10:51:05,028 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:05,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 10:51:05,033 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:05,035 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:05,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:51:05,040 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:102, output treesize:20 [2018-04-11 10:51:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:05,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:51:05,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-04-11 10:51:05,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 10:51:05,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 10:51:05,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2018-04-11 10:51:05,095 INFO L87 Difference]: Start difference. First operand 466 states and 647 transitions. Second operand 25 states. [2018-04-11 10:51:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:07,561 INFO L93 Difference]: Finished difference Result 913 states and 1159 transitions. [2018-04-11 10:51:07,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 10:51:07,561 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-04-11 10:51:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:07,563 INFO L225 Difference]: With dead ends: 913 [2018-04-11 10:51:07,563 INFO L226 Difference]: Without dead ends: 913 [2018-04-11 10:51:07,563 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=466, Invalid=1514, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 10:51:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-04-11 10:51:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 461. [2018-04-11 10:51:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-04-11 10:51:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 642 transitions. [2018-04-11 10:51:07,568 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 642 transitions. Word has length 34 [2018-04-11 10:51:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:07,568 INFO L459 AbstractCegarLoop]: Abstraction has 461 states and 642 transitions. [2018-04-11 10:51:07,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 10:51:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 642 transitions. [2018-04-11 10:51:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 10:51:07,569 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:07,569 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:07,569 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1086725402, now seen corresponding path program 1 times [2018-04-11 10:51:07,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:07,569 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:07,569 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:07,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:07,570 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:07,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:07,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:07,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 10:51:07,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 10:51:07,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 10:51:07,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:51:07,688 INFO L87 Difference]: Start difference. First operand 461 states and 642 transitions. Second operand 11 states. [2018-04-11 10:51:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:08,169 INFO L93 Difference]: Finished difference Result 708 states and 921 transitions. [2018-04-11 10:51:08,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 10:51:08,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-11 10:51:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:08,170 INFO L225 Difference]: With dead ends: 708 [2018-04-11 10:51:08,170 INFO L226 Difference]: Without dead ends: 708 [2018-04-11 10:51:08,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-04-11 10:51:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-04-11 10:51:08,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 471. [2018-04-11 10:51:08,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-04-11 10:51:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 654 transitions. [2018-04-11 10:51:08,177 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 654 transitions. Word has length 35 [2018-04-11 10:51:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:08,177 INFO L459 AbstractCegarLoop]: Abstraction has 471 states and 654 transitions. [2018-04-11 10:51:08,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 10:51:08,177 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 654 transitions. [2018-04-11 10:51:08,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 10:51:08,178 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:08,178 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:08,178 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:08,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1086725401, now seen corresponding path program 1 times [2018-04-11 10:51:08,178 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:08,179 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:08,179 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:08,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:08,179 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:08,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:08,313 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 10:51:08,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:08,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 10:51:08,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 10:51:08,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 10:51:08,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:51:08,314 INFO L87 Difference]: Start difference. First operand 471 states and 654 transitions. Second operand 11 states. [2018-04-11 10:51:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:08,893 INFO L93 Difference]: Finished difference Result 905 states and 1184 transitions. [2018-04-11 10:51:08,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 10:51:08,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-11 10:51:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:08,895 INFO L225 Difference]: With dead ends: 905 [2018-04-11 10:51:08,895 INFO L226 Difference]: Without dead ends: 905 [2018-04-11 10:51:08,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-04-11 10:51:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-04-11 10:51:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 471. [2018-04-11 10:51:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-04-11 10:51:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 653 transitions. [2018-04-11 10:51:08,900 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 653 transitions. Word has length 35 [2018-04-11 10:51:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:08,900 INFO L459 AbstractCegarLoop]: Abstraction has 471 states and 653 transitions. [2018-04-11 10:51:08,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 10:51:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 653 transitions. [2018-04-11 10:51:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 10:51:08,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:08,901 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:08,901 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1464376684, now seen corresponding path program 1 times [2018-04-11 10:51:08,902 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:08,902 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:08,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:08,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:08,902 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:08,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:08,928 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 10:51:08,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:08,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:51:08,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:51:08,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:51:08,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:51:08,929 INFO L87 Difference]: Start difference. First operand 471 states and 653 transitions. Second operand 4 states. [2018-04-11 10:51:09,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:09,115 INFO L93 Difference]: Finished difference Result 1198 states and 1675 transitions. [2018-04-11 10:51:09,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:51:09,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-04-11 10:51:09,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:09,118 INFO L225 Difference]: With dead ends: 1198 [2018-04-11 10:51:09,118 INFO L226 Difference]: Without dead ends: 1198 [2018-04-11 10:51:09,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:51:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-04-11 10:51:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 468. [2018-04-11 10:51:09,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-11 10:51:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 651 transitions. [2018-04-11 10:51:09,123 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 651 transitions. Word has length 35 [2018-04-11 10:51:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:09,123 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 651 transitions. [2018-04-11 10:51:09,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:51:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 651 transitions. [2018-04-11 10:51:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 10:51:09,123 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:09,123 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:09,124 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:09,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1464376685, now seen corresponding path program 1 times [2018-04-11 10:51:09,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:09,124 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:09,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:09,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:09,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:09,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:09,156 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 10:51:09,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:09,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:51:09,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:51:09,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:51:09,157 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:51:09,157 INFO L87 Difference]: Start difference. First operand 468 states and 651 transitions. Second operand 4 states. [2018-04-11 10:51:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:09,261 INFO L93 Difference]: Finished difference Result 470 states and 652 transitions. [2018-04-11 10:51:09,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:51:09,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-04-11 10:51:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:09,262 INFO L225 Difference]: With dead ends: 470 [2018-04-11 10:51:09,262 INFO L226 Difference]: Without dead ends: 470 [2018-04-11 10:51:09,263 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:51:09,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-11 10:51:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2018-04-11 10:51:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-04-11 10:51:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 651 transitions. [2018-04-11 10:51:09,266 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 651 transitions. Word has length 35 [2018-04-11 10:51:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:09,266 INFO L459 AbstractCegarLoop]: Abstraction has 469 states and 651 transitions. [2018-04-11 10:51:09,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:51:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 651 transitions. [2018-04-11 10:51:09,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 10:51:09,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:09,266 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] [2018-04-11 10:51:09,266 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1293426211, now seen corresponding path program 1 times [2018-04-11 10:51:09,267 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:09,267 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:09,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:09,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:09,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:09,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:09,297 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 10:51:09,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:09,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:51:09,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:51:09,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:51:09,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:51:09,298 INFO L87 Difference]: Start difference. First operand 469 states and 651 transitions. Second operand 6 states. [2018-04-11 10:51:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:09,430 INFO L93 Difference]: Finished difference Result 581 states and 813 transitions. [2018-04-11 10:51:09,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:51:09,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-04-11 10:51:09,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:09,431 INFO L225 Difference]: With dead ends: 581 [2018-04-11 10:51:09,431 INFO L226 Difference]: Without dead ends: 581 [2018-04-11 10:51:09,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:51:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-04-11 10:51:09,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 478. [2018-04-11 10:51:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-04-11 10:51:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 663 transitions. [2018-04-11 10:51:09,435 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 663 transitions. Word has length 36 [2018-04-11 10:51:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:09,435 INFO L459 AbstractCegarLoop]: Abstraction has 478 states and 663 transitions. [2018-04-11 10:51:09,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:51:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 663 transitions. [2018-04-11 10:51:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 10:51:09,435 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:09,435 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] [2018-04-11 10:51:09,435 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:09,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1299151849, now seen corresponding path program 1 times [2018-04-11 10:51:09,436 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:09,436 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:09,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:09,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:09,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:09,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:09,607 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 10:51:09,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:09,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 10:51:09,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 10:51:09,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 10:51:09,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-04-11 10:51:09,608 INFO L87 Difference]: Start difference. First operand 478 states and 663 transitions. Second operand 13 states. [2018-04-11 10:51:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:10,162 INFO L93 Difference]: Finished difference Result 608 states and 812 transitions. [2018-04-11 10:51:10,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 10:51:10,163 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-04-11 10:51:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:10,164 INFO L225 Difference]: With dead ends: 608 [2018-04-11 10:51:10,164 INFO L226 Difference]: Without dead ends: 608 [2018-04-11 10:51:10,164 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-04-11 10:51:10,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-04-11 10:51:10,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 432. [2018-04-11 10:51:10,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-04-11 10:51:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 586 transitions. [2018-04-11 10:51:10,167 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 586 transitions. Word has length 36 [2018-04-11 10:51:10,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:10,167 INFO L459 AbstractCegarLoop]: Abstraction has 432 states and 586 transitions. [2018-04-11 10:51:10,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 10:51:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 586 transitions. [2018-04-11 10:51:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 10:51:10,168 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:10,168 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:10,168 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:10,168 INFO L82 PathProgramCache]: Analyzing trace with hash 827290309, now seen corresponding path program 1 times [2018-04-11 10:51:10,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:10,168 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:10,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:10,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:10,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:10,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:10,267 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 10:51:10,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:10,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 10:51:10,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 10:51:10,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 10:51:10,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:51:10,267 INFO L87 Difference]: Start difference. First operand 432 states and 586 transitions. Second operand 11 states. [2018-04-11 10:51:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:10,676 INFO L93 Difference]: Finished difference Result 644 states and 817 transitions. [2018-04-11 10:51:10,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 10:51:10,677 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-04-11 10:51:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:10,678 INFO L225 Difference]: With dead ends: 644 [2018-04-11 10:51:10,678 INFO L226 Difference]: Without dead ends: 644 [2018-04-11 10:51:10,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-04-11 10:51:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-04-11 10:51:10,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 435. [2018-04-11 10:51:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-11 10:51:10,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 590 transitions. [2018-04-11 10:51:10,681 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 590 transitions. Word has length 38 [2018-04-11 10:51:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:10,681 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 590 transitions. [2018-04-11 10:51:10,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 10:51:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 590 transitions. [2018-04-11 10:51:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 10:51:10,682 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:10,682 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:10,682 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:10,682 INFO L82 PathProgramCache]: Analyzing trace with hash 827291432, now seen corresponding path program 1 times [2018-04-11 10:51:10,682 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:10,682 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:10,683 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:10,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:10,683 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:10,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:10,701 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 10:51:10,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:10,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:51:10,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:51:10,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:51:10,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:51:10,702 INFO L87 Difference]: Start difference. First operand 435 states and 590 transitions. Second operand 5 states. [2018-04-11 10:51:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:10,849 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2018-04-11 10:51:10,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:51:10,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-11 10:51:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:10,850 INFO L225 Difference]: With dead ends: 434 [2018-04-11 10:51:10,850 INFO L226 Difference]: Without dead ends: 434 [2018-04-11 10:51:10,851 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:51:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-04-11 10:51:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-04-11 10:51:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-11 10:51:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 586 transitions. [2018-04-11 10:51:10,853 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 586 transitions. Word has length 38 [2018-04-11 10:51:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:10,853 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 586 transitions. [2018-04-11 10:51:10,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:51:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 586 transitions. [2018-04-11 10:51:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 10:51:10,854 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:10,854 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:10,854 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:10,854 INFO L82 PathProgramCache]: Analyzing trace with hash 827291433, now seen corresponding path program 1 times [2018-04-11 10:51:10,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:10,854 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:10,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:10,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:10,855 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:10,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:10,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:10,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:51:10,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:51:10,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:51:10,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:51:10,900 INFO L87 Difference]: Start difference. First operand 434 states and 586 transitions. Second operand 5 states. [2018-04-11 10:51:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:11,059 INFO L93 Difference]: Finished difference Result 433 states and 582 transitions. [2018-04-11 10:51:11,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:51:11,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-11 10:51:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:11,060 INFO L225 Difference]: With dead ends: 433 [2018-04-11 10:51:11,060 INFO L226 Difference]: Without dead ends: 433 [2018-04-11 10:51:11,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:51:11,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-11 10:51:11,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-04-11 10:51:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 10:51:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 582 transitions. [2018-04-11 10:51:11,063 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 582 transitions. Word has length 38 [2018-04-11 10:51:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:11,063 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 582 transitions. [2018-04-11 10:51:11,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:51:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 582 transitions. [2018-04-11 10:51:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 10:51:11,064 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:11,064 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:11,064 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1263089809, now seen corresponding path program 1 times [2018-04-11 10:51:11,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:11,064 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:11,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:11,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:11,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:11,074 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:11,121 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 10:51:11,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:11,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:51:11,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:51:11,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:51:11,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:51:11,122 INFO L87 Difference]: Start difference. First operand 433 states and 582 transitions. Second operand 6 states. [2018-04-11 10:51:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:11,404 INFO L93 Difference]: Finished difference Result 915 states and 1262 transitions. [2018-04-11 10:51:11,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:51:11,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-04-11 10:51:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:11,409 INFO L225 Difference]: With dead ends: 915 [2018-04-11 10:51:11,409 INFO L226 Difference]: Without dead ends: 915 [2018-04-11 10:51:11,409 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:51:11,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-04-11 10:51:11,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 437. [2018-04-11 10:51:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-11 10:51:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 586 transitions. [2018-04-11 10:51:11,416 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 586 transitions. Word has length 38 [2018-04-11 10:51:11,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:11,416 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 586 transitions. [2018-04-11 10:51:11,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:51:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 586 transitions. [2018-04-11 10:51:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 10:51:11,417 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:11,417 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 10:51:11,417 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:11,417 INFO L82 PathProgramCache]: Analyzing trace with hash -123803838, now seen corresponding path program 1 times [2018-04-11 10:51:11,417 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:11,417 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:11,418 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:11,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:11,418 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:11,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:11,463 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 10:51:11,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:11,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:51:11,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:51:11,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:51:11,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:51:11,464 INFO L87 Difference]: Start difference. First operand 437 states and 586 transitions. Second operand 5 states. [2018-04-11 10:51:11,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:11,630 INFO L93 Difference]: Finished difference Result 436 states and 582 transitions. [2018-04-11 10:51:11,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:51:11,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-11 10:51:11,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:11,632 INFO L225 Difference]: With dead ends: 436 [2018-04-11 10:51:11,632 INFO L226 Difference]: Without dead ends: 436 [2018-04-11 10:51:11,632 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:51:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-04-11 10:51:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-04-11 10:51:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-04-11 10:51:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 582 transitions. [2018-04-11 10:51:11,637 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 582 transitions. Word has length 39 [2018-04-11 10:51:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:11,637 INFO L459 AbstractCegarLoop]: Abstraction has 436 states and 582 transitions. [2018-04-11 10:51:11,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:51:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 582 transitions. [2018-04-11 10:51:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 10:51:11,637 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:11,638 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 10:51:11,638 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:11,638 INFO L82 PathProgramCache]: Analyzing trace with hash -247563480, now seen corresponding path program 1 times [2018-04-11 10:51:11,638 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:11,638 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:11,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:11,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:11,639 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:11,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:11,675 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 10:51:11,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:11,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:51:11,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:51:11,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:51:11,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:51:11,676 INFO L87 Difference]: Start difference. First operand 436 states and 582 transitions. Second operand 4 states. [2018-04-11 10:51:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:11,871 INFO L93 Difference]: Finished difference Result 1167 states and 1587 transitions. [2018-04-11 10:51:11,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:51:11,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-04-11 10:51:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:11,874 INFO L225 Difference]: With dead ends: 1167 [2018-04-11 10:51:11,874 INFO L226 Difference]: Without dead ends: 1167 [2018-04-11 10:51:11,874 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:51:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-04-11 10:51:11,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 435. [2018-04-11 10:51:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-11 10:51:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 581 transitions. [2018-04-11 10:51:11,879 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 581 transitions. Word has length 39 [2018-04-11 10:51:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:11,879 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 581 transitions. [2018-04-11 10:51:11,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:51:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 581 transitions. [2018-04-11 10:51:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 10:51:11,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:11,879 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 10:51:11,879 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:11,879 INFO L82 PathProgramCache]: Analyzing trace with hash -247563479, now seen corresponding path program 1 times [2018-04-11 10:51:11,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:11,880 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:11,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:11,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:11,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:11,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:11,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:11,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:51:11,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:51:11,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:51:11,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:51:11,908 INFO L87 Difference]: Start difference. First operand 435 states and 581 transitions. Second operand 4 states. [2018-04-11 10:51:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:12,018 INFO L93 Difference]: Finished difference Result 433 states and 579 transitions. [2018-04-11 10:51:12,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:51:12,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-04-11 10:51:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:12,019 INFO L225 Difference]: With dead ends: 433 [2018-04-11 10:51:12,019 INFO L226 Difference]: Without dead ends: 433 [2018-04-11 10:51:12,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:51:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-11 10:51:12,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-04-11 10:51:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 10:51:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 579 transitions. [2018-04-11 10:51:12,023 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 579 transitions. Word has length 39 [2018-04-11 10:51:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:12,024 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 579 transitions. [2018-04-11 10:51:12,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:51:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 579 transitions. [2018-04-11 10:51:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 10:51:12,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:12,024 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 10:51:12,024 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:12,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1316978381, now seen corresponding path program 1 times [2018-04-11 10:51:12,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:12,025 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:12,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:12,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:12,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:12,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:12,219 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 10:51:12,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:12,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 10:51:12,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 10:51:12,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 10:51:12,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-04-11 10:51:12,219 INFO L87 Difference]: Start difference. First operand 433 states and 579 transitions. Second operand 16 states. [2018-04-11 10:51:12,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:12,856 INFO L93 Difference]: Finished difference Result 781 states and 971 transitions. [2018-04-11 10:51:12,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 10:51:12,857 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-11 10:51:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:12,858 INFO L225 Difference]: With dead ends: 781 [2018-04-11 10:51:12,858 INFO L226 Difference]: Without dead ends: 781 [2018-04-11 10:51:12,858 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-04-11 10:51:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-04-11 10:51:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 438. [2018-04-11 10:51:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-11 10:51:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-04-11 10:51:12,861 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 41 [2018-04-11 10:51:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:12,861 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-04-11 10:51:12,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 10:51:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-04-11 10:51:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 10:51:12,862 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:12,862 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 10:51:12,862 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1316978382, now seen corresponding path program 1 times [2018-04-11 10:51:12,862 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:12,862 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:12,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:12,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:12,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:12,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:12,990 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 10:51:12,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:12,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 10:51:12,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 10:51:12,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 10:51:12,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-04-11 10:51:12,991 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 12 states. [2018-04-11 10:51:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:13,499 INFO L93 Difference]: Finished difference Result 613 states and 776 transitions. [2018-04-11 10:51:13,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 10:51:13,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-11 10:51:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:13,500 INFO L225 Difference]: With dead ends: 613 [2018-04-11 10:51:13,500 INFO L226 Difference]: Without dead ends: 613 [2018-04-11 10:51:13,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-04-11 10:51:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-11 10:51:13,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 433. [2018-04-11 10:51:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 10:51:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 578 transitions. [2018-04-11 10:51:13,503 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 578 transitions. Word has length 41 [2018-04-11 10:51:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:13,503 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 578 transitions. [2018-04-11 10:51:13,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 10:51:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 578 transitions. [2018-04-11 10:51:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 10:51:13,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:13,504 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 10:51:13,504 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:13,504 INFO L82 PathProgramCache]: Analyzing trace with hash 500119061, now seen corresponding path program 1 times [2018-04-11 10:51:13,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:13,504 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:13,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:13,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:13,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:13,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:13,530 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 10:51:13,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:13,531 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:51:13,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:51:13,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:51:13,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:51:13,531 INFO L87 Difference]: Start difference. First operand 433 states and 578 transitions. Second operand 5 states. [2018-04-11 10:51:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:13,712 INFO L93 Difference]: Finished difference Result 670 states and 898 transitions. [2018-04-11 10:51:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:51:13,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-04-11 10:51:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:13,714 INFO L225 Difference]: With dead ends: 670 [2018-04-11 10:51:13,714 INFO L226 Difference]: Without dead ends: 670 [2018-04-11 10:51:13,714 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:51:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-04-11 10:51:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 432. [2018-04-11 10:51:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-04-11 10:51:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 577 transitions. [2018-04-11 10:51:13,717 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 577 transitions. Word has length 41 [2018-04-11 10:51:13,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:13,718 INFO L459 AbstractCegarLoop]: Abstraction has 432 states and 577 transitions. [2018-04-11 10:51:13,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:51:13,718 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 577 transitions. [2018-04-11 10:51:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 10:51:13,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:13,718 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 10:51:13,718 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:13,718 INFO L82 PathProgramCache]: Analyzing trace with hash 500119062, now seen corresponding path program 1 times [2018-04-11 10:51:13,718 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:13,718 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:13,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:13,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:13,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:13,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:13,773 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 10:51:13,773 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:13,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:51:13,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:51:13,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:51:13,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:51:13,774 INFO L87 Difference]: Start difference. First operand 432 states and 577 transitions. Second operand 5 states. [2018-04-11 10:51:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:13,958 INFO L93 Difference]: Finished difference Result 664 states and 887 transitions. [2018-04-11 10:51:13,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:51:13,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-04-11 10:51:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:13,960 INFO L225 Difference]: With dead ends: 664 [2018-04-11 10:51:13,960 INFO L226 Difference]: Without dead ends: 664 [2018-04-11 10:51:13,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:51:13,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-04-11 10:51:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 431. [2018-04-11 10:51:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-04-11 10:51:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 576 transitions. [2018-04-11 10:51:13,963 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 576 transitions. Word has length 41 [2018-04-11 10:51:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:13,963 INFO L459 AbstractCegarLoop]: Abstraction has 431 states and 576 transitions. [2018-04-11 10:51:13,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:51:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 576 transitions. [2018-04-11 10:51:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 10:51:13,963 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:13,963 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:13,963 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash -704663211, now seen corresponding path program 1 times [2018-04-11 10:51:13,964 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:13,964 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:13,964 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:13,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:13,964 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:13,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:13,994 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 10:51:13,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:13,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:51:13,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:51:13,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:51:13,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:51:13,995 INFO L87 Difference]: Start difference. First operand 431 states and 576 transitions. Second operand 5 states. [2018-04-11 10:51:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:14,204 INFO L93 Difference]: Finished difference Result 902 states and 1239 transitions. [2018-04-11 10:51:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:51:14,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-11 10:51:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:14,205 INFO L225 Difference]: With dead ends: 902 [2018-04-11 10:51:14,206 INFO L226 Difference]: Without dead ends: 902 [2018-04-11 10:51:14,206 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:51:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-04-11 10:51:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 422. [2018-04-11 10:51:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-04-11 10:51:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 567 transitions. [2018-04-11 10:51:14,209 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 567 transitions. Word has length 42 [2018-04-11 10:51:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:14,209 INFO L459 AbstractCegarLoop]: Abstraction has 422 states and 567 transitions. [2018-04-11 10:51:14,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:51:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 567 transitions. [2018-04-11 10:51:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 10:51:14,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:14,210 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:14,210 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:14,210 INFO L82 PathProgramCache]: Analyzing trace with hash 891196517, now seen corresponding path program 1 times [2018-04-11 10:51:14,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:14,210 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:14,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:14,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:14,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:14,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:14,402 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 10:51:14,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:51:14,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 10:51:14,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 10:51:14,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 10:51:14,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-04-11 10:51:14,403 INFO L87 Difference]: Start difference. First operand 422 states and 567 transitions. Second operand 16 states. [2018-04-11 10:51:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:15,296 INFO L93 Difference]: Finished difference Result 740 states and 921 transitions. [2018-04-11 10:51:15,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 10:51:15,297 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-11 10:51:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:15,298 INFO L225 Difference]: With dead ends: 740 [2018-04-11 10:51:15,298 INFO L226 Difference]: Without dead ends: 740 [2018-04-11 10:51:15,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=348, Invalid=1292, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 10:51:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-04-11 10:51:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 452. [2018-04-11 10:51:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-11 10:51:15,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 612 transitions. [2018-04-11 10:51:15,302 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 612 transitions. Word has length 43 [2018-04-11 10:51:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:15,302 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 612 transitions. [2018-04-11 10:51:15,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 10:51:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 612 transitions. [2018-04-11 10:51:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 10:51:15,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:15,303 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:15,303 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1802679286, now seen corresponding path program 1 times [2018-04-11 10:51:15,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:15,303 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:15,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:15,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:15,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:15,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:15,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:51:15,436 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:51:15,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:15,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:51:15,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:51:15,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:51:15,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:51:15,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:51:15,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-11 10:51:15,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:51:15,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:51:15,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:51:15,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:51:15,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,538 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-11 10:51:15,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,558 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 10:51:15,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-04-11 10:51:15,582 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 30 treesize of output 23 [2018-04-11 10:51:15,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 10:51:15,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,606 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 30 treesize of output 23 [2018-04-11 10:51:15,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 10:51:15,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,623 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:48 [2018-04-11 10:51:15,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-04-11 10:51:15,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:15,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,682 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 40 treesize of output 41 [2018-04-11 10:51:15,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:15,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,697 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:94, output treesize:48 [2018-04-11 10:51:15,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:51:15,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:47 [2018-04-11 10:51:15,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 10:51:15,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 8 treesize of output 7 [2018-04-11 10:51:15,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,768 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 38 treesize of output 39 [2018-04-11 10:51:15,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:51:15,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,785 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2018-04-11 10:51:15,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-04-11 10:51:15,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:15,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 10:51:15,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:15,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:51:15,848 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:57 [2018-04-11 10:51:15,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-04-11 10:51:15,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 10:51:15,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,952 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-04-11 10:51:15,952 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 10:51:15,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:15,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 10:51:15,962 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,963 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:15,965 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:71, output treesize:7 [2018-04-11 10:51:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:15,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:51:15,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-04-11 10:51:15,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 10:51:15,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 10:51:15,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-04-11 10:51:15,994 INFO L87 Difference]: Start difference. First operand 452 states and 612 transitions. Second operand 22 states. [2018-04-11 10:51:31,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:31,438 INFO L93 Difference]: Finished difference Result 731 states and 920 transitions. [2018-04-11 10:51:31,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 10:51:31,439 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-04-11 10:51:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:31,440 INFO L225 Difference]: With dead ends: 731 [2018-04-11 10:51:31,440 INFO L226 Difference]: Without dead ends: 731 [2018-04-11 10:51:31,440 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 10:51:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-04-11 10:51:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 469. [2018-04-11 10:51:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-04-11 10:51:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 634 transitions. [2018-04-11 10:51:31,443 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 634 transitions. Word has length 45 [2018-04-11 10:51:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:31,444 INFO L459 AbstractCegarLoop]: Abstraction has 469 states and 634 transitions. [2018-04-11 10:51:31,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 10:51:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 634 transitions. [2018-04-11 10:51:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 10:51:31,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:31,444 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:31,444 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash 509694365, now seen corresponding path program 1 times [2018-04-11 10:51:31,444 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:31,444 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:31,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:31,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:31,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:31,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:31,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:51:31,622 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:51:31,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:31,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:51:31,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:51:31,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:51:31,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:51:31,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:51:31,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 10:51:31,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:51:31,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:51:31,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:51:31,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:51:31,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,791 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-11 10:51:31,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,812 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 10:51:31,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-11 10:51:31,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 10:51:31,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 10:51:31,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,868 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 30 treesize of output 23 [2018-04-11 10:51:31,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 10:51:31,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:54 [2018-04-11 10:51:31,945 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 40 treesize of output 41 [2018-04-11 10:51:31,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:31,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-04-11 10:51:31,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:31,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:100, output treesize:54 [2018-04-11 10:51:31,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:31,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:51:31,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:31,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:53 [2018-04-11 10:51:32,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-11 10:51:32,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:51:32,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,073 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 10:51:32,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:51:32,075 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,088 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:53 [2018-04-11 10:51:32,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-04-11 10:51:32,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:32,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-04-11 10:51:32,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:32,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:51:32,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:63 [2018-04-11 10:51:32,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-04-11 10:51:32,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:32,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:32,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:32,309 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-04-11 10:51:32,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,316 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 6 treesize of output 4 [2018-04-11 10:51:32,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 10:51:32,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:32,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 10:51:32,329 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,332 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:32,337 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:77, output treesize:7 [2018-04-11 10:51:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:32,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:51:32,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 25 [2018-04-11 10:51:32,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 10:51:32,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 10:51:32,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-04-11 10:51:32,389 INFO L87 Difference]: Start difference. First operand 469 states and 634 transitions. Second operand 25 states. [2018-04-11 10:51:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:51:48,525 INFO L93 Difference]: Finished difference Result 725 states and 910 transitions. [2018-04-11 10:51:48,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 10:51:48,526 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-04-11 10:51:48,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:51:48,527 INFO L225 Difference]: With dead ends: 725 [2018-04-11 10:51:48,527 INFO L226 Difference]: Without dead ends: 725 [2018-04-11 10:51:48,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=657, Invalid=2205, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 10:51:48,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-04-11 10:51:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 524. [2018-04-11 10:51:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-04-11 10:51:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 719 transitions. [2018-04-11 10:51:48,533 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 719 transitions. Word has length 46 [2018-04-11 10:51:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:51:48,533 INFO L459 AbstractCegarLoop]: Abstraction has 524 states and 719 transitions. [2018-04-11 10:51:48,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 10:51:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 719 transitions. [2018-04-11 10:51:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 10:51:48,533 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:51:48,533 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:51:48,533 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:51:48,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1319746159, now seen corresponding path program 1 times [2018-04-11 10:51:48,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:51:48,534 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:51:48,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:48,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:48,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:51:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:48,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:51:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:48,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:51:48,660 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:51:48,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:51:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:51:48,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:51:48,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:48,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:48,710 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 10:51:48,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 10:51:48,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:51:48,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:51:48,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 10:51:48,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 10:51:48,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:48,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,769 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 10:51:48,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:19 [2018-04-11 10:51:48,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:48,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:51:48,772 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 10:51:48,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 10:51:48,806 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 22 treesize of output 23 [2018-04-11 10:51:48,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:51:48,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,815 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 10:51:48,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2018-04-11 10:51:48,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 10:51:48,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:51:48,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:51:48,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:39 [2018-04-11 10:51:48,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-04-11 10:51:48,966 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:51:48,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 10:51:48,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,971 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 6 treesize of output 4 [2018-04-11 10:51:48,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:51:48,976 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:54, output treesize:5 [2018-04-11 10:51:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:51:48,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:51:48,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-04-11 10:51:48,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 10:51:48,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 10:51:48,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-04-11 10:51:49,000 INFO L87 Difference]: Start difference. First operand 524 states and 719 transitions. Second operand 26 states. [2018-04-11 10:52:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:02,995 INFO L93 Difference]: Finished difference Result 762 states and 985 transitions. [2018-04-11 10:52:02,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 10:52:02,995 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-04-11 10:52:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:02,996 INFO L225 Difference]: With dead ends: 762 [2018-04-11 10:52:02,996 INFO L226 Difference]: Without dead ends: 762 [2018-04-11 10:52:02,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=538, Invalid=2218, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 10:52:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-04-11 10:52:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 529. [2018-04-11 10:52:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-04-11 10:52:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 725 transitions. [2018-04-11 10:52:03,001 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 725 transitions. Word has length 47 [2018-04-11 10:52:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:03,002 INFO L459 AbstractCegarLoop]: Abstraction has 529 states and 725 transitions. [2018-04-11 10:52:03,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 10:52:03,002 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 725 transitions. [2018-04-11 10:52:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 10:52:03,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:03,003 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:03,003 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:03,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1319746158, now seen corresponding path program 1 times [2018-04-11 10:52:03,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:03,003 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:03,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:03,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:03,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:03,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:03,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:03,142 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:03,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:03,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:03,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:03,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:03,195 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 10:52:03,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 10:52:03,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:03,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:03,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:03,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:03,221 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,227 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 10:52:03,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-04-11 10:52:03,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:03,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 10:52:03,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:03,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:28 [2018-04-11 10:52:03,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:03,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:03,288 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 10:52:03,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-04-11 10:52:03,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 10:52:03,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:03,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 10:52:03,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:03,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2018-04-11 10:52:03,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 10:52:03,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:03,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-04-11 10:52:03,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:03,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:03,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:84, output treesize:48 [2018-04-11 10:52:03,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-04-11 10:52:03,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 10:52:03,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,621 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:03,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 10:52:03,621 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 10:52:03,635 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:03,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:52:03,635 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,637 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:03,643 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:72, output treesize:9 [2018-04-11 10:52:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:03,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:52:03,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-04-11 10:52:03,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 10:52:03,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 10:52:03,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-04-11 10:52:03,674 INFO L87 Difference]: Start difference. First operand 529 states and 725 transitions. Second operand 26 states. [2018-04-11 10:52:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:15,485 INFO L93 Difference]: Finished difference Result 776 states and 999 transitions. [2018-04-11 10:52:15,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 10:52:15,485 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-04-11 10:52:15,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:15,486 INFO L225 Difference]: With dead ends: 776 [2018-04-11 10:52:15,486 INFO L226 Difference]: Without dead ends: 776 [2018-04-11 10:52:15,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=484, Invalid=1868, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 10:52:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-04-11 10:52:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 529. [2018-04-11 10:52:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-04-11 10:52:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 724 transitions. [2018-04-11 10:52:15,490 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 724 transitions. Word has length 47 [2018-04-11 10:52:15,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:15,490 INFO L459 AbstractCegarLoop]: Abstraction has 529 states and 724 transitions. [2018-04-11 10:52:15,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 10:52:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 724 transitions. [2018-04-11 10:52:15,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 10:52:15,491 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:15,491 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:15,491 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1681070032, now seen corresponding path program 1 times [2018-04-11 10:52:15,491 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:15,491 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:15,492 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:15,492 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:15,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:15,721 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 10:52:15,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:15,721 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:15,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:15,741 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:15,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:15,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 25 [2018-04-11 10:52:15,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:15,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:15,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:28 [2018-04-11 10:52:15,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:15,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:15,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:15,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:15,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:15,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:46 [2018-04-11 10:52:15,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-04-11 10:52:15,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 12 treesize of output 11 [2018-04-11 10:52:15,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:15,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:15,848 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 10:52:15,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:37 [2018-04-11 10:52:15,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-04-11 10:52:15,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 25 [2018-04-11 10:52:15,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:52:15,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:52:15,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:52:15,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:63 [2018-04-11 10:52:15,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:15,997 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 34 treesize of output 28 [2018-04-11 10:52:15,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:16,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:16,018 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 4 case distinctions, treesize of input 38 treesize of output 45 [2018-04-11 10:52:16,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 10:52:16,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-04-11 10:52:16,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:73, output treesize:118 [2018-04-11 10:52:16,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:16,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:16,142 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 10:52:16,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:16,148 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 10:52:16,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25 [2018-04-11 10:52:16,208 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 10:52:16,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:52:16,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 23 [2018-04-11 10:52:16,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 10:52:16,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 10:52:16,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=500, Unknown=1, NotChecked=0, Total=552 [2018-04-11 10:52:16,227 INFO L87 Difference]: Start difference. First operand 529 states and 724 transitions. Second operand 24 states. [2018-04-11 10:52:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:18,299 INFO L93 Difference]: Finished difference Result 858 states and 1144 transitions. [2018-04-11 10:52:18,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 10:52:18,299 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-04-11 10:52:18,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:18,300 INFO L225 Difference]: With dead ends: 858 [2018-04-11 10:52:18,300 INFO L226 Difference]: Without dead ends: 854 [2018-04-11 10:52:18,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=1251, Unknown=1, NotChecked=0, Total=1406 [2018-04-11 10:52:18,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-04-11 10:52:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 590. [2018-04-11 10:52:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-11 10:52:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 826 transitions. [2018-04-11 10:52:18,304 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 826 transitions. Word has length 48 [2018-04-11 10:52:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:18,305 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 826 transitions. [2018-04-11 10:52:18,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 10:52:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 826 transitions. [2018-04-11 10:52:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 10:52:18,305 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:18,305 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:18,305 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1681072013, now seen corresponding path program 1 times [2018-04-11 10:52:18,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:18,305 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:18,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:18,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:18,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:18,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:18,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:18,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:18,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 10:52:18,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 10:52:18,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:52:18,327 INFO L87 Difference]: Start difference. First operand 590 states and 826 transitions. Second operand 3 states. [2018-04-11 10:52:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:18,338 INFO L93 Difference]: Finished difference Result 525 states and 679 transitions. [2018-04-11 10:52:18,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 10:52:18,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-04-11 10:52:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:18,339 INFO L225 Difference]: With dead ends: 525 [2018-04-11 10:52:18,340 INFO L226 Difference]: Without dead ends: 500 [2018-04-11 10:52:18,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:52:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-04-11 10:52:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 484. [2018-04-11 10:52:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-04-11 10:52:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 654 transitions. [2018-04-11 10:52:18,344 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 654 transitions. Word has length 48 [2018-04-11 10:52:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:18,344 INFO L459 AbstractCegarLoop]: Abstraction has 484 states and 654 transitions. [2018-04-11 10:52:18,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 10:52:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 654 transitions. [2018-04-11 10:52:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 10:52:18,345 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:18,345 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:18,345 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:18,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1629524322, now seen corresponding path program 1 times [2018-04-11 10:52:18,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:18,346 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:18,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:18,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:18,346 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:18,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:18,566 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:18,566 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:18,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:18,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:18,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:18,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:18,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:18,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:18,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,671 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 10:52:18,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:18,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:18,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 11 treesize of output 4 [2018-04-11 10:52:18,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-11 10:52:18,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 10:52:18,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:18,717 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 18 treesize of output 27 [2018-04-11 10:52:18,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,750 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 23 treesize of output 18 [2018-04-11 10:52:18,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:18,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 10:52:18,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2018-04-11 10:52:18,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 10:52:18,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:18,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-04-11 10:52:18,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:18,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:37 [2018-04-11 10:52:18,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:18,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:18,852 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 10:52:18,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:36 [2018-04-11 10:52:18,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 10:52:18,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:18,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-04-11 10:52:18,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:18,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,956 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2018-04-11 10:52:18,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 10:52:18,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:18,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:18,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-04-11 10:52:19,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:19,000 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:19,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:19,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:19,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:82, output treesize:46 [2018-04-11 10:52:19,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-04-11 10:52:19,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:19,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:19,212 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:19,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2018-04-11 10:52:19,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:19,249 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 6 treesize of output 4 [2018-04-11 10:52:19,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:19,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:19,262 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 10:52:19,265 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:19,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:52:19,265 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:19,268 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:19,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:19,275 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:70, output treesize:7 [2018-04-11 10:52:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:19,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:52:19,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 27 [2018-04-11 10:52:19,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 10:52:19,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 10:52:19,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-04-11 10:52:19,316 INFO L87 Difference]: Start difference. First operand 484 states and 654 transitions. Second operand 27 states. [2018-04-11 10:52:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:35,101 INFO L93 Difference]: Finished difference Result 600 states and 781 transitions. [2018-04-11 10:52:35,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 10:52:35,102 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2018-04-11 10:52:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:35,103 INFO L225 Difference]: With dead ends: 600 [2018-04-11 10:52:35,103 INFO L226 Difference]: Without dead ends: 600 [2018-04-11 10:52:35,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=509, Invalid=1747, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 10:52:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-04-11 10:52:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 438. [2018-04-11 10:52:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-11 10:52:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 578 transitions. [2018-04-11 10:52:35,109 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 578 transitions. Word has length 48 [2018-04-11 10:52:35,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:35,109 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 578 transitions. [2018-04-11 10:52:35,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 10:52:35,109 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 578 transitions. [2018-04-11 10:52:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 10:52:35,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:35,109 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:35,109 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:35,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1806446818, now seen corresponding path program 1 times [2018-04-11 10:52:35,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:35,110 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:35,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:35,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:35,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:35,584 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 10:52:35,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:35,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-11 10:52:35,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 10:52:35,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 10:52:35,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-04-11 10:52:35,585 INFO L87 Difference]: Start difference. First operand 438 states and 578 transitions. Second operand 19 states. [2018-04-11 10:52:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:36,854 INFO L93 Difference]: Finished difference Result 874 states and 1110 transitions. [2018-04-11 10:52:36,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 10:52:36,854 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-11 10:52:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:36,855 INFO L225 Difference]: With dead ends: 874 [2018-04-11 10:52:36,855 INFO L226 Difference]: Without dead ends: 874 [2018-04-11 10:52:36,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 10:52:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-04-11 10:52:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 497. [2018-04-11 10:52:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-11 10:52:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 662 transitions. [2018-04-11 10:52:36,859 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 662 transitions. Word has length 49 [2018-04-11 10:52:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:36,859 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 662 transitions. [2018-04-11 10:52:36,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 10:52:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 662 transitions. [2018-04-11 10:52:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 10:52:36,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:36,860 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:36,860 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1806446819, now seen corresponding path program 1 times [2018-04-11 10:52:36,860 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:36,860 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:36,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:36,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:36,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:36,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:37,255 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 10:52:37,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:37,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 10:52:37,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 10:52:37,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 10:52:37,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-04-11 10:52:37,256 INFO L87 Difference]: Start difference. First operand 497 states and 662 transitions. Second operand 18 states. [2018-04-11 10:52:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:38,643 INFO L93 Difference]: Finished difference Result 876 states and 1112 transitions. [2018-04-11 10:52:38,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 10:52:38,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-04-11 10:52:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:38,645 INFO L225 Difference]: With dead ends: 876 [2018-04-11 10:52:38,645 INFO L226 Difference]: Without dead ends: 876 [2018-04-11 10:52:38,645 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 10:52:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-04-11 10:52:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 497. [2018-04-11 10:52:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-11 10:52:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 661 transitions. [2018-04-11 10:52:38,649 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 661 transitions. Word has length 49 [2018-04-11 10:52:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:38,649 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 661 transitions. [2018-04-11 10:52:38,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 10:52:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 661 transitions. [2018-04-11 10:52:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 10:52:38,649 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:38,649 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:38,650 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:38,650 INFO L82 PathProgramCache]: Analyzing trace with hash -8372055, now seen corresponding path program 1 times [2018-04-11 10:52:38,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:38,650 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:38,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:38,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:38,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:38,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:38,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:38,735 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:38,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:38,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:38,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:38,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:38,819 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 10:52:38,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:38,825 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 10:52:38,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:38,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:38,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-11 10:52:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:38,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:52:38,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2018-04-11 10:52:38,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 10:52:38,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 10:52:38,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-04-11 10:52:38,939 INFO L87 Difference]: Start difference. First operand 497 states and 661 transitions. Second operand 16 states. [2018-04-11 10:52:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:39,576 INFO L93 Difference]: Finished difference Result 696 states and 861 transitions. [2018-04-11 10:52:39,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 10:52:39,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-11 10:52:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:39,577 INFO L225 Difference]: With dead ends: 696 [2018-04-11 10:52:39,577 INFO L226 Difference]: Without dead ends: 696 [2018-04-11 10:52:39,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2018-04-11 10:52:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-04-11 10:52:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 399. [2018-04-11 10:52:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-04-11 10:52:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 494 transitions. [2018-04-11 10:52:39,581 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 494 transitions. Word has length 50 [2018-04-11 10:52:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:39,581 INFO L459 AbstractCegarLoop]: Abstraction has 399 states and 494 transitions. [2018-04-11 10:52:39,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 10:52:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 494 transitions. [2018-04-11 10:52:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 10:52:39,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:39,581 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:39,581 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:39,581 INFO L82 PathProgramCache]: Analyzing trace with hash 165276669, now seen corresponding path program 1 times [2018-04-11 10:52:39,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:39,582 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:39,582 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:39,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:39,582 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:39,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:39,598 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 10:52:39,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:39,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:39,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:52:39,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:52:39,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:52:39,599 INFO L87 Difference]: Start difference. First operand 399 states and 494 transitions. Second operand 4 states. [2018-04-11 10:52:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:39,858 INFO L93 Difference]: Finished difference Result 770 states and 952 transitions. [2018-04-11 10:52:39,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:52:39,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-04-11 10:52:39,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:39,859 INFO L225 Difference]: With dead ends: 770 [2018-04-11 10:52:39,859 INFO L226 Difference]: Without dead ends: 770 [2018-04-11 10:52:39,859 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-04-11 10:52:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 398. [2018-04-11 10:52:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-11 10:52:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 493 transitions. [2018-04-11 10:52:39,862 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 493 transitions. Word has length 50 [2018-04-11 10:52:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:39,862 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 493 transitions. [2018-04-11 10:52:39,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:52:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 493 transitions. [2018-04-11 10:52:39,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 10:52:39,863 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:39,863 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:39,863 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:39,863 INFO L82 PathProgramCache]: Analyzing trace with hash 165276670, now seen corresponding path program 1 times [2018-04-11 10:52:39,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:39,863 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:39,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:39,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:39,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:39,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:39,900 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 10:52:39,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:39,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:52:39,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:52:39,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:52:39,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:52:39,902 INFO L87 Difference]: Start difference. First operand 398 states and 493 transitions. Second operand 4 states. [2018-04-11 10:52:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:40,100 INFO L93 Difference]: Finished difference Result 734 states and 914 transitions. [2018-04-11 10:52:40,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:52:40,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-04-11 10:52:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:40,101 INFO L225 Difference]: With dead ends: 734 [2018-04-11 10:52:40,101 INFO L226 Difference]: Without dead ends: 734 [2018-04-11 10:52:40,101 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-04-11 10:52:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 397. [2018-04-11 10:52:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-11 10:52:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 492 transitions. [2018-04-11 10:52:40,104 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 492 transitions. Word has length 50 [2018-04-11 10:52:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:40,105 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 492 transitions. [2018-04-11 10:52:40,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:52:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 492 transitions. [2018-04-11 10:52:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 10:52:40,105 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:40,105 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:40,105 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash -426931142, now seen corresponding path program 1 times [2018-04-11 10:52:40,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:40,105 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:40,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:40,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:40,106 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:40,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:40,302 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:40,303 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:40,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:40,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:40,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:40,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:40,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 10:52:40,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 10:52:40,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:40,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:40,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:40,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:40,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,435 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 10:52:40,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-04-11 10:52:40,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:40,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 10:52:40,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:40,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,495 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:28 [2018-04-11 10:52:40,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:40,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:40,497 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 10:52:40,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-04-11 10:52:40,537 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 22 treesize of output 23 [2018-04-11 10:52:40,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:40,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 10:52:40,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:40,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:23 [2018-04-11 10:52:40,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-11 10:52:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 10:52:40,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-04-11 10:52:40,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 10:52:40,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:40,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2018-04-11 10:52:40,748 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 10:52:40,749 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:40,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:52:40,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:40,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-11 10:52:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:40,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:52:40,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2018-04-11 10:52:40,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 10:52:40,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 10:52:40,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-04-11 10:52:40,777 INFO L87 Difference]: Start difference. First operand 397 states and 492 transitions. Second operand 25 states. [2018-04-11 10:52:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:41,883 INFO L93 Difference]: Finished difference Result 537 states and 625 transitions. [2018-04-11 10:52:41,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 10:52:41,883 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-11 10:52:41,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:41,884 INFO L225 Difference]: With dead ends: 537 [2018-04-11 10:52:41,884 INFO L226 Difference]: Without dead ends: 537 [2018-04-11 10:52:41,884 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=399, Invalid=1493, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 10:52:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-04-11 10:52:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 400. [2018-04-11 10:52:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-04-11 10:52:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 496 transitions. [2018-04-11 10:52:41,889 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 496 transitions. Word has length 50 [2018-04-11 10:52:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:41,889 INFO L459 AbstractCegarLoop]: Abstraction has 400 states and 496 transitions. [2018-04-11 10:52:41,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 10:52:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 496 transitions. [2018-04-11 10:52:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 10:52:41,889 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:41,890 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:41,890 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:41,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1555912094, now seen corresponding path program 1 times [2018-04-11 10:52:41,890 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:41,890 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:41,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:41,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:41,890 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:41,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:42,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:42,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:42,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-11 10:52:42,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 10:52:42,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 10:52:42,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-04-11 10:52:42,286 INFO L87 Difference]: Start difference. First operand 400 states and 496 transitions. Second operand 19 states. [2018-04-11 10:52:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:43,458 INFO L93 Difference]: Finished difference Result 757 states and 914 transitions. [2018-04-11 10:52:43,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 10:52:43,458 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-04-11 10:52:43,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:43,460 INFO L225 Difference]: With dead ends: 757 [2018-04-11 10:52:43,460 INFO L226 Difference]: Without dead ends: 757 [2018-04-11 10:52:43,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 10:52:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-04-11 10:52:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 463. [2018-04-11 10:52:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-11 10:52:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 583 transitions. [2018-04-11 10:52:43,465 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 583 transitions. Word has length 53 [2018-04-11 10:52:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:43,465 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 583 transitions. [2018-04-11 10:52:43,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 10:52:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 583 transitions. [2018-04-11 10:52:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 10:52:43,466 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:43,466 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:43,466 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:43,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1555912095, now seen corresponding path program 1 times [2018-04-11 10:52:43,467 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:43,467 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:43,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:43,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:43,467 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:43,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:43,913 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 10:52:43,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:43,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 10:52:43,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 10:52:43,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 10:52:43,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-04-11 10:52:43,913 INFO L87 Difference]: Start difference. First operand 463 states and 583 transitions. Second operand 18 states. [2018-04-11 10:52:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:45,440 INFO L93 Difference]: Finished difference Result 760 states and 917 transitions. [2018-04-11 10:52:45,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 10:52:45,472 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-04-11 10:52:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:45,474 INFO L225 Difference]: With dead ends: 760 [2018-04-11 10:52:45,474 INFO L226 Difference]: Without dead ends: 760 [2018-04-11 10:52:45,474 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 10:52:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-04-11 10:52:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 459. [2018-04-11 10:52:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-04-11 10:52:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 578 transitions. [2018-04-11 10:52:45,477 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 578 transitions. Word has length 53 [2018-04-11 10:52:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:45,477 INFO L459 AbstractCegarLoop]: Abstraction has 459 states and 578 transitions. [2018-04-11 10:52:45,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 10:52:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 578 transitions. [2018-04-11 10:52:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 10:52:45,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:45,478 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:45,478 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1724885864, now seen corresponding path program 1 times [2018-04-11 10:52:45,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:45,479 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:45,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:45,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:45,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:45,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:45,577 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 10:52:45,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:45,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 10:52:45,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 10:52:45,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 10:52:45,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:52:45,578 INFO L87 Difference]: Start difference. First operand 459 states and 578 transitions. Second operand 10 states. [2018-04-11 10:52:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:46,023 INFO L93 Difference]: Finished difference Result 760 states and 951 transitions. [2018-04-11 10:52:46,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 10:52:46,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-04-11 10:52:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:46,024 INFO L225 Difference]: With dead ends: 760 [2018-04-11 10:52:46,024 INFO L226 Difference]: Without dead ends: 760 [2018-04-11 10:52:46,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-04-11 10:52:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-04-11 10:52:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 458. [2018-04-11 10:52:46,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-11 10:52:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 577 transitions. [2018-04-11 10:52:46,028 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 577 transitions. Word has length 53 [2018-04-11 10:52:46,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:46,028 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 577 transitions. [2018-04-11 10:52:46,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 10:52:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 577 transitions. [2018-04-11 10:52:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 10:52:46,028 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:46,029 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:46,029 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:46,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1724885865, now seen corresponding path program 1 times [2018-04-11 10:52:46,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:46,029 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:46,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:46,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:46,030 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:46,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:46,189 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 10:52:46,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:46,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 10:52:46,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 10:52:46,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 10:52:46,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-11 10:52:46,190 INFO L87 Difference]: Start difference. First operand 458 states and 577 transitions. Second operand 10 states. [2018-04-11 10:52:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:46,630 INFO L93 Difference]: Finished difference Result 759 states and 950 transitions. [2018-04-11 10:52:46,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 10:52:46,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-04-11 10:52:46,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:46,631 INFO L225 Difference]: With dead ends: 759 [2018-04-11 10:52:46,631 INFO L226 Difference]: Without dead ends: 759 [2018-04-11 10:52:46,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-04-11 10:52:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-04-11 10:52:46,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 457. [2018-04-11 10:52:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-04-11 10:52:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 576 transitions. [2018-04-11 10:52:46,634 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 576 transitions. Word has length 53 [2018-04-11 10:52:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:46,634 INFO L459 AbstractCegarLoop]: Abstraction has 457 states and 576 transitions. [2018-04-11 10:52:46,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 10:52:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 576 transitions. [2018-04-11 10:52:46,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 10:52:46,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:46,635 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:46,635 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:46,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1273760456, now seen corresponding path program 1 times [2018-04-11 10:52:46,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:46,635 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:46,635 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:46,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:46,635 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:46,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:46,787 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:46,787 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:46,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:46,819 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:46,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:46,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:46,865 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 10:52:46,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:46,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:46,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 10:52:46,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:46,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:46,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:46,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:46,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:46,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 10:52:46,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 10:52:46,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 14 treesize of output 13 [2018-04-11 10:52:46,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:46,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:46,940 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 10:52:46,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:19 [2018-04-11 10:52:46,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:46,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:46,943 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 10:52:46,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:46,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:46,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 10:52:47,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 57 [2018-04-11 10:52:47,029 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 49 treesize of output 48 [2018-04-11 10:52:47,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,055 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 35 treesize of output 36 [2018-04-11 10:52:47,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:47,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,067 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:51 [2018-04-11 10:52:47,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 97 [2018-04-11 10:52:47,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 86 [2018-04-11 10:52:47,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:52:47,189 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 75 treesize of output 59 [2018-04-11 10:52:47,189 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-04-11 10:52:47,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 10:52:47,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,224 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:109, output treesize:60 [2018-04-11 10:52:47,355 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 51 treesize of output 45 [2018-04-11 10:52:47,357 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:47,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-11 10:52:47,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,371 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 10:52:47,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:63 [2018-04-11 10:52:47,488 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:47,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-04-11 10:52:47,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 10:52:47,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,497 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 8 treesize of output 4 [2018-04-11 10:52:47,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:47,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:47,505 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:67, output treesize:15 [2018-04-11 10:52:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:47,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 10:52:47,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [14] total 32 [2018-04-11 10:52:47,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 10:52:47,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 10:52:47,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 10:52:47,655 INFO L87 Difference]: Start difference. First operand 457 states and 576 transitions. Second operand 33 states. [2018-04-11 10:52:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:50,822 INFO L93 Difference]: Finished difference Result 925 states and 1099 transitions. [2018-04-11 10:52:50,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 10:52:50,823 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-04-11 10:52:50,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:50,824 INFO L225 Difference]: With dead ends: 925 [2018-04-11 10:52:50,824 INFO L226 Difference]: Without dead ends: 925 [2018-04-11 10:52:50,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=836, Invalid=3324, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 10:52:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-04-11 10:52:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 462. [2018-04-11 10:52:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-04-11 10:52:50,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 582 transitions. [2018-04-11 10:52:50,829 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 582 transitions. Word has length 53 [2018-04-11 10:52:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:50,829 INFO L459 AbstractCegarLoop]: Abstraction has 462 states and 582 transitions. [2018-04-11 10:52:50,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 10:52:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 582 transitions. [2018-04-11 10:52:50,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 10:52:50,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:50,830 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:50,830 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:50,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1273760455, now seen corresponding path program 1 times [2018-04-11 10:52:50,831 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:50,831 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:50,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:50,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:50,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:50,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:51,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:51,286 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:51,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:51,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:51,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:51,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:51,351 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 10:52:51,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 10:52:51,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:51,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:51,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:51,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:51,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 10:52:51,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 10:52:51,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:51,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 10:52:51,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:51,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:28 [2018-04-11 10:52:51,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:51,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:51,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:52:51,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-04-11 10:52:51,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 10:52:51,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:51,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,538 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 22 treesize of output 23 [2018-04-11 10:52:51,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:52:51,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:37 [2018-04-11 10:52:51,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-04-11 10:52:51,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 20 treesize of output 19 [2018-04-11 10:52:51,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-04-11 10:52:51,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 10:52:51,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:83 [2018-04-11 10:52:51,878 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:51,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2018-04-11 10:52:51,881 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:51,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2018-04-11 10:52:51,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,888 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:51,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-04-11 10:52:51,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:51,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:51,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-04-11 10:52:51,907 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:51,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 10:52:51,907 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,911 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 10:52:51,911 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,912 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:51,918 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:127, output treesize:9 [2018-04-11 10:52:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:51,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:52:51,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2018-04-11 10:52:51,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 10:52:51,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 10:52:51,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 10:52:51,987 INFO L87 Difference]: Start difference. First operand 462 states and 582 transitions. Second operand 39 states. [2018-04-11 10:52:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:55,510 INFO L93 Difference]: Finished difference Result 898 states and 1054 transitions. [2018-04-11 10:52:55,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 10:52:55,510 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2018-04-11 10:52:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:55,511 INFO L225 Difference]: With dead ends: 898 [2018-04-11 10:52:55,511 INFO L226 Difference]: Without dead ends: 898 [2018-04-11 10:52:55,511 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=733, Invalid=3959, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 10:52:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-04-11 10:52:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 465. [2018-04-11 10:52:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-11 10:52:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 586 transitions. [2018-04-11 10:52:55,514 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 586 transitions. Word has length 53 [2018-04-11 10:52:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:55,514 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 586 transitions. [2018-04-11 10:52:55,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 10:52:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 586 transitions. [2018-04-11 10:52:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 10:52:55,515 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:55,515 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:55,515 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:55,515 INFO L82 PathProgramCache]: Analyzing trace with hash -831868191, now seen corresponding path program 1 times [2018-04-11 10:52:55,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:55,515 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:55,515 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:55,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:55,516 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:55,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 10:52:55,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:55,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:52:55,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:52:55,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:52:55,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:52:55,535 INFO L87 Difference]: Start difference. First operand 465 states and 586 transitions. Second operand 5 states. [2018-04-11 10:52:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:55,662 INFO L93 Difference]: Finished difference Result 464 states and 582 transitions. [2018-04-11 10:52:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:52:55,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-04-11 10:52:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:55,663 INFO L225 Difference]: With dead ends: 464 [2018-04-11 10:52:55,663 INFO L226 Difference]: Without dead ends: 464 [2018-04-11 10:52:55,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:52:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-11 10:52:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2018-04-11 10:52:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-04-11 10:52:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 582 transitions. [2018-04-11 10:52:55,665 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 582 transitions. Word has length 54 [2018-04-11 10:52:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:55,665 INFO L459 AbstractCegarLoop]: Abstraction has 464 states and 582 transitions. [2018-04-11 10:52:55,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:52:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 582 transitions. [2018-04-11 10:52:55,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 10:52:55,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:55,666 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:52:55,666 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash -831868190, now seen corresponding path program 1 times [2018-04-11 10:52:55,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:55,666 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:55,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:55,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:55,666 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:55,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 10:52:55,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:52:55,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:52:55,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:52:55,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:52:55,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:52:55,717 INFO L87 Difference]: Start difference. First operand 464 states and 582 transitions. Second operand 6 states. [2018-04-11 10:52:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:52:55,862 INFO L93 Difference]: Finished difference Result 463 states and 578 transitions. [2018-04-11 10:52:55,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 10:52:55,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-04-11 10:52:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:52:55,862 INFO L225 Difference]: With dead ends: 463 [2018-04-11 10:52:55,862 INFO L226 Difference]: Without dead ends: 463 [2018-04-11 10:52:55,862 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:52:55,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-11 10:52:55,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-04-11 10:52:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-11 10:52:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 578 transitions. [2018-04-11 10:52:55,865 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 578 transitions. Word has length 54 [2018-04-11 10:52:55,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:52:55,865 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 578 transitions. [2018-04-11 10:52:55,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:52:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 578 transitions. [2018-04-11 10:52:55,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 10:52:55,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:52:55,866 INFO L355 BasicCegarLoop]: trace histogram [3, 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 10:52:55,866 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:52:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1261495612, now seen corresponding path program 1 times [2018-04-11 10:52:55,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:52:55,866 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:52:55,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:55,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:55,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:52:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:55,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:52:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:56,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:52:56,355 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:52:56,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:52:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:52:56,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:52:56,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:56,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:56,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:52:56,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:52:56,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,416 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 10:52:56,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 10:52:56,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-11 10:52:56,460 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 23 treesize of output 18 [2018-04-11 10:52:56,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 10:52:56,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,484 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 23 treesize of output 18 [2018-04-11 10:52:56,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,486 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 18 treesize of output 27 [2018-04-11 10:52:56,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,489 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2018-04-11 10:52:56,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-04-11 10:52:56,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:56,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 10:52:56,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:52:56,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:37 [2018-04-11 10:52:56,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,604 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 10:52:56,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:42 [2018-04-11 10:52:56,658 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 31 treesize of output 24 [2018-04-11 10:52:56,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 47 [2018-04-11 10:52:56,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 10:52:56,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:52:56,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:56,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:58 [2018-04-11 10:52:56,730 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 38 treesize of output 39 [2018-04-11 10:52:56,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-11 10:52:56,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-04-11 10:52:56,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15 [2018-04-11 10:52:56,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:56,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:84 [2018-04-11 10:52:56,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-04-11 10:52:56,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 10:52:56,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 62 [2018-04-11 10:52:56,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2018-04-11 10:52:56,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:56,867 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:106 [2018-04-11 10:52:56,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:52:56,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,921 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 10:52:56,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:111, output treesize:105 [2018-04-11 10:52:56,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 85 [2018-04-11 10:52:56,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:56,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-11 10:52:56,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:56,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:57,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2018-04-11 10:52:57,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 70 [2018-04-11 10:52:57,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:57,018 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:57,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:57,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:131, output treesize:111 [2018-04-11 10:52:57,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 181 [2018-04-11 10:52:57,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 160 treesize of output 203 [2018-04-11 10:52:57,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 10:52:57,220 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 153 treesize of output 152 [2018-04-11 10:52:57,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:57,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:52:57,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 134 [2018-04-11 10:52:57,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 125 [2018-04-11 10:52:57,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:57,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:57,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 159 [2018-04-11 10:52:57,352 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 184 treesize of output 183 [2018-04-11 10:52:57,352 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:57,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 201 [2018-04-11 10:52:57,424 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-04-11 10:52:57,512 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 10:52:57,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 134 [2018-04-11 10:52:57,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:57,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 123 [2018-04-11 10:52:57,525 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:57,539 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:57,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 10:52:57,612 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:203, output treesize:445 [2018-04-11 10:52:58,293 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 131 treesize of output 115 [2018-04-11 10:52:58,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,296 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:58,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2018-04-11 10:52:58,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:58,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:52:58,315 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:58,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 115 [2018-04-11 10:52:58,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,378 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:58,381 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 0 case distinctions, treesize of input 57 treesize of output 82 [2018-04-11 10:52:58,381 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,398 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 45 treesize of output 34 [2018-04-11 10:52:58,398 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:58,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:58,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-04-11 10:52:58,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-11 10:52:58,448 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,456 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:58,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:52:58,457 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,462 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 111 [2018-04-11 10:52:58,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,502 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 35 treesize of output 21 [2018-04-11 10:52:58,503 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,516 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:58,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 58 [2018-04-11 10:52:58,520 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:58,532 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:58,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-04-11 10:52:58,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-11 10:52:58,565 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,578 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:58,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 53 [2018-04-11 10:52:58,581 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,590 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,611 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 53 treesize of output 45 [2018-04-11 10:52:58,613 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:52:58,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:52:58,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2018-04-11 10:52:58,615 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:52:58,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 10:52:58,623 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,628 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:52:58,647 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 18 variables, input treesize:392, output treesize:7 [2018-04-11 10:52:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:52:58,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:52:58,725 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-04-11 10:52:58,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 10:52:58,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 10:52:58,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1677, Unknown=4, NotChecked=0, Total=1892 [2018-04-11 10:52:58,726 INFO L87 Difference]: Start difference. First operand 463 states and 578 transitions. Second operand 44 states. [2018-04-11 10:53:00,971 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 214 DAG size of output 111 [2018-04-11 10:53:01,203 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 211 DAG size of output 108 [2018-04-11 10:53:01,829 WARN L151 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 213 DAG size of output 110 [2018-04-11 10:53:02,118 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 216 DAG size of output 112 [2018-04-11 10:53:02,364 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 218 DAG size of output 114 [2018-04-11 10:53:02,579 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 197 DAG size of output 98 [2018-04-11 10:53:02,794 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 220 DAG size of output 116 [2018-04-11 10:53:03,220 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 102 DAG size of output 98 [2018-04-11 10:53:03,522 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 204 DAG size of output 101 [2018-04-11 10:53:06,213 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 199 DAG size of output 100 [2018-04-11 10:53:06,557 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 202 DAG size of output 100 [2018-04-11 10:53:07,134 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 204 DAG size of output 102 [2018-04-11 10:53:09,460 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 206 DAG size of output 104 [2018-04-11 10:53:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:53:11,024 INFO L93 Difference]: Finished difference Result 925 states and 1074 transitions. [2018-04-11 10:53:11,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 10:53:11,024 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 60 [2018-04-11 10:53:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:53:11,025 INFO L225 Difference]: With dead ends: 925 [2018-04-11 10:53:11,025 INFO L226 Difference]: Without dead ends: 925 [2018-04-11 10:53:11,025 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1634, Invalid=5672, Unknown=4, NotChecked=0, Total=7310 [2018-04-11 10:53:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-04-11 10:53:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 437. [2018-04-11 10:53:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-11 10:53:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 536 transitions. [2018-04-11 10:53:11,028 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 536 transitions. Word has length 60 [2018-04-11 10:53:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:53:11,028 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 536 transitions. [2018-04-11 10:53:11,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 10:53:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 536 transitions. [2018-04-11 10:53:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 10:53:11,029 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:53:11,029 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:53:11,029 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:53:11,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1115327643, now seen corresponding path program 1 times [2018-04-11 10:53:11,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:53:11,029 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:53:11,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:11,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:11,029 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:11,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:53:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:53:11,198 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:53:11,198 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:53:11,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:11,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:53:11,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:11,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:11,255 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 10:53:11,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 10:53:11,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:53:11,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:53:11,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-04-11 10:53:11,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 10:53:11,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:53:11,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,347 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 10:53:11,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:33 [2018-04-11 10:53:11,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:11,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:11,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:11,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 10:53:11,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2018-04-11 10:53:11,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 49 [2018-04-11 10:53:11,447 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 24 treesize of output 23 [2018-04-11 10:53:11,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2018-04-11 10:53:11,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:53:11,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:57 [2018-04-11 10:53:11,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 89 [2018-04-11 10:53:11,540 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 36 treesize of output 19 [2018-04-11 10:53:11,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-04-11 10:53:11,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 10:53:11,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,567 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:112, output treesize:82 [2018-04-11 10:53:11,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 122 [2018-04-11 10:53:11,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 96 [2018-04-11 10:53:11,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,874 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 85 [2018-04-11 10:53:11,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:53:11,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 69 [2018-04-11 10:53:11,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:11,955 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 96 treesize of output 77 [2018-04-11 10:53:11,956 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:53:11,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:11,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 92 [2018-04-11 10:53:11,995 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:53:12,029 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 77 treesize of output 61 [2018-04-11 10:53:12,029 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,067 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 92 treesize of output 77 [2018-04-11 10:53:12,067 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 10:53:12,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:12,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 117 [2018-04-11 10:53:12,119 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 10:53:12,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-11 10:53:12,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 58 [2018-04-11 10:53:12,250 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 45 [2018-04-11 10:53:12,250 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2018-04-11 10:53:12,264 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,276 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 32 treesize of output 25 [2018-04-11 10:53:12,276 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-11 10:53:12,288 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,298 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 28 treesize of output 21 [2018-04-11 10:53:12,298 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,304 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 64 [2018-04-11 10:53:12,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2018-04-11 10:53:12,311 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:12,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 28 [2018-04-11 10:53:12,330 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:53:12,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:12,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 32 [2018-04-11 10:53:12,345 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:53:12,359 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 23 [2018-04-11 10:53:12,359 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,370 INFO L267 ElimStorePlain]: Start of recursive call 17: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2018-04-11 10:53:12,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:12,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-04-11 10:53:12,376 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:53:12,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 10:53:12,382 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 10:53:12,387 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,390 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 66 [2018-04-11 10:53:12,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-04-11 10:53:12,394 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2018-04-11 10:53:12,401 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,403 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 92 [2018-04-11 10:53:12,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 38 [2018-04-11 10:53:12,418 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,448 INFO L267 ElimStorePlain]: Start of recursive call 29: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2018-04-11 10:53:12,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-11 10:53:12,453 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-04-11 10:53:12,459 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 10:53:12,464 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,468 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2018-04-11 10:53:12,472 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 9 treesize of output 1 [2018-04-11 10:53:12,472 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,488 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 13 treesize of output 1 [2018-04-11 10:53:12,488 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:12,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-04-11 10:53:12,497 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,502 INFO L267 ElimStorePlain]: Start of recursive call 35: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:53:12,520 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 3 variables, input treesize:157, output treesize:73 [2018-04-11 10:53:12,604 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 10:53:12,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:12,607 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 10:53:12,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:13 [2018-04-11 10:53:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:53:12,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:53:12,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 39 [2018-04-11 10:53:12,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 10:53:12,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 10:53:12,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1361, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 10:53:12,671 INFO L87 Difference]: Start difference. First operand 437 states and 536 transitions. Second operand 39 states. [2018-04-11 10:53:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:53:15,842 INFO L93 Difference]: Finished difference Result 588 states and 688 transitions. [2018-04-11 10:53:15,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 10:53:15,842 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 60 [2018-04-11 10:53:15,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:53:15,843 INFO L225 Difference]: With dead ends: 588 [2018-04-11 10:53:15,843 INFO L226 Difference]: Without dead ends: 586 [2018-04-11 10:53:15,843 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=776, Invalid=4336, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 10:53:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-04-11 10:53:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 435. [2018-04-11 10:53:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-11 10:53:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 533 transitions. [2018-04-11 10:53:15,846 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 533 transitions. Word has length 60 [2018-04-11 10:53:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:53:15,846 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 533 transitions. [2018-04-11 10:53:15,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 10:53:15,846 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 533 transitions. [2018-04-11 10:53:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 10:53:15,846 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:53:15,846 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:53:15,846 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:53:15,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1599938534, now seen corresponding path program 1 times [2018-04-11 10:53:15,847 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:53:15,847 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:53:15,847 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:15,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:15,847 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:15,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:53:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:53:16,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:53:16,270 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:53:16,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:16,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:53:16,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:16,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:16,326 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 10:53:16,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 10:53:16,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:53:16,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:53:16,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:53:16,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:53:16,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-04-11 10:53:16,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-04-11 10:53:16,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:53:16,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,408 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 23 treesize of output 14 [2018-04-11 10:53:16,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:53:16,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:19 [2018-04-11 10:53:16,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:16,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:16,421 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 10:53:16,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 10:53:16,455 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 22 treesize of output 23 [2018-04-11 10:53:16,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:53:16,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:53:16,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:53:16,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:18 [2018-04-11 10:53:16,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-04-11 10:53:16,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 10:53:16,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2018-04-11 10:53:16,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 10:53:16,510 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,518 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:34 [2018-04-11 10:53:16,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-11 10:53:16,725 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:53:16,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 10:53:16,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,741 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 10:53:16,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:48 [2018-04-11 10:53:16,776 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 10:53:16,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-04-11 10:53:16,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-11 10:53:16,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,782 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 8 treesize of output 4 [2018-04-11 10:53:16,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,787 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:10 [2018-04-11 10:53:16,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:16,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 10:53:16,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:16,818 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 10:53:16,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 10:53:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:53:16,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:53:16,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2018-04-11 10:53:16,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 10:53:16,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 10:53:16,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 10:53:16,863 INFO L87 Difference]: Start difference. First operand 435 states and 533 transitions. Second operand 38 states. [2018-04-11 10:53:19,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:53:19,647 INFO L93 Difference]: Finished difference Result 590 states and 684 transitions. [2018-04-11 10:53:19,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 10:53:19,647 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 60 [2018-04-11 10:53:19,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:53:19,648 INFO L225 Difference]: With dead ends: 590 [2018-04-11 10:53:19,648 INFO L226 Difference]: Without dead ends: 590 [2018-04-11 10:53:19,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=760, Invalid=4070, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 10:53:19,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-04-11 10:53:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 437. [2018-04-11 10:53:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-11 10:53:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 535 transitions. [2018-04-11 10:53:19,651 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 535 transitions. Word has length 60 [2018-04-11 10:53:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:53:19,651 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 535 transitions. [2018-04-11 10:53:19,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 10:53:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 535 transitions. [2018-04-11 10:53:19,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 10:53:19,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:53:19,651 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:53:19,651 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:53:19,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1009835691, now seen corresponding path program 1 times [2018-04-11 10:53:19,651 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:53:19,652 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:53:19,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:19,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:19,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:19,657 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:53:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:53:19,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:53:19,754 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:53:19,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:19,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:53:19,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,782 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 10:53:19,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 10:53:19,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:53:19,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:53:19,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-11 10:53:19,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 10:53:19,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:53:19,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-11 10:53:19,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 10:53:19,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:53:19,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-11 10:53:19,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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 10:53:19,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-04-11 10:53:19,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-04-11 10:53:19,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 10:53:19,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-04-11 10:53:19,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 77 [2018-04-11 10:53:19,935 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 92 treesize of output 91 [2018-04-11 10:53:19,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:19,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:19,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 91 [2018-04-11 10:53:19,993 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 10:53:20,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 10:53:20,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 10:53:20,070 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:87, output treesize:197 [2018-04-11 10:53:28,392 WARN L148 SmtUtils]: Spent 8286ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-11 10:53:32,821 WARN L148 SmtUtils]: Spent 4398ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-11 10:53:32,829 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 63 treesize of output 39 [2018-04-11 10:53:32,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:32,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:32,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:32,833 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-04-11 10:53:32,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 10:53:32,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2018-04-11 10:53:32,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-04-11 10:53:32,862 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:32,866 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 32 treesize of output 18 [2018-04-11 10:53:32,867 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,869 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2018-04-11 10:53:32,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:32,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-04-11 10:53:32,887 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 10:53:32,892 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,895 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2018-04-11 10:53:32,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:32,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-04-11 10:53:32,917 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 10:53:32,920 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,922 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:32,929 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:225, output treesize:5 [2018-04-11 10:53:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:53:32,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:53:32,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 21 [2018-04-11 10:53:32,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 10:53:32,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 10:53:32,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-04-11 10:53:32,968 INFO L87 Difference]: Start difference. First operand 437 states and 535 transitions. Second operand 22 states. [2018-04-11 10:53:34,272 WARN L151 SmtUtils]: Spent 376ms on a formula simplification. DAG size of input: 125 DAG size of output 77 [2018-04-11 10:53:34,877 WARN L151 SmtUtils]: Spent 576ms on a formula simplification. DAG size of input: 120 DAG size of output 76 [2018-04-11 10:53:35,598 WARN L151 SmtUtils]: Spent 488ms on a formula simplification. DAG size of input: 111 DAG size of output 71 [2018-04-11 10:53:36,246 WARN L151 SmtUtils]: Spent 576ms on a formula simplification. DAG size of input: 123 DAG size of output 79 [2018-04-11 10:53:36,653 WARN L148 SmtUtils]: Spent 313ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-11 10:53:37,190 WARN L151 SmtUtils]: Spent 501ms on a formula simplification. DAG size of input: 74 DAG size of output 72 [2018-04-11 10:53:37,685 WARN L151 SmtUtils]: Spent 473ms on a formula simplification. DAG size of input: 71 DAG size of output 69 [2018-04-11 10:53:38,415 WARN L151 SmtUtils]: Spent 658ms on a formula simplification. DAG size of input: 114 DAG size of output 74 [2018-04-11 10:53:39,738 WARN L151 SmtUtils]: Spent 685ms on a formula simplification. DAG size of input: 114 DAG size of output 74 [2018-04-11 10:53:40,057 WARN L148 SmtUtils]: Spent 279ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-11 10:53:40,397 WARN L148 SmtUtils]: Spent 319ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-11 10:53:41,291 WARN L151 SmtUtils]: Spent 625ms on a formula simplification. DAG size of input: 107 DAG size of output 68 [2018-04-11 10:53:41,943 WARN L151 SmtUtils]: Spent 569ms on a formula simplification. DAG size of input: 110 DAG size of output 71 [2018-04-11 10:53:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:53:41,965 INFO L93 Difference]: Finished difference Result 992 states and 1177 transitions. [2018-04-11 10:53:41,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 10:53:41,965 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-04-11 10:53:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:53:41,966 INFO L225 Difference]: With dead ends: 992 [2018-04-11 10:53:41,966 INFO L226 Difference]: Without dead ends: 992 [2018-04-11 10:53:41,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=421, Invalid=1464, Unknown=7, NotChecked=0, Total=1892 [2018-04-11 10:53:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-04-11 10:53:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 506. [2018-04-11 10:53:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-11 10:53:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 630 transitions. [2018-04-11 10:53:41,971 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 630 transitions. Word has length 61 [2018-04-11 10:53:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:53:41,971 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 630 transitions. [2018-04-11 10:53:41,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 10:53:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 630 transitions. [2018-04-11 10:53:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 10:53:41,971 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:53:41,972 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:53:41,972 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:53:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1009835692, now seen corresponding path program 1 times [2018-04-11 10:53:41,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:53:41,972 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:53:41,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:41,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:41,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:41,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:53:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:53:42,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:53:42,126 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:53:42,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:42,150 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:53:42,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 10:53:42,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 10:53:42,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:53:42,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:53:42,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:53:42,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:53:42,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 10:53:42,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 10:53:42,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 10:53:42,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,202 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 30 treesize of output 31 [2018-04-11 10:53:42,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:53:42,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-04-11 10:53:42,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2018-04-11 10:53:42,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-11 10:53:42,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,263 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 52 treesize of output 51 [2018-04-11 10:53:42,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:53:42,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,280 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:67 [2018-04-11 10:53:42,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:53:42,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:66 [2018-04-11 10:53:42,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2018-04-11 10:53:42,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-11 10:53:42,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 71 [2018-04-11 10:53:42,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 10:53:42,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:79 [2018-04-11 10:53:42,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 99 [2018-04-11 10:53:42,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 96 [2018-04-11 10:53:42,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 10:53:42,516 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 46 treesize of output 45 [2018-04-11 10:53:42,516 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:53:42,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 86 [2018-04-11 10:53:42,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 83 [2018-04-11 10:53:42,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,585 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 109 [2018-04-11 10:53:42,600 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 128 treesize of output 127 [2018-04-11 10:53:42,600 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 103 [2018-04-11 10:53:42,665 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-04-11 10:53:42,725 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 10:53:42,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 86 [2018-04-11 10:53:42,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 83 [2018-04-11 10:53:42,735 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,745 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 10:53:42,796 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:135, output treesize:291 [2018-04-11 10:53:42,908 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 83 treesize of output 61 [2018-04-11 10:53:42,910 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 37 treesize of output 24 [2018-04-11 10:53:42,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,940 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 84 treesize of output 70 [2018-04-11 10:53:42,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 10:53:42,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-11 10:53:42,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 10:53:42,973 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,976 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:42,994 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 58 treesize of output 40 [2018-04-11 10:53:42,996 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 19 treesize of output 6 [2018-04-11 10:53:42,996 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:42,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 10:53:42,999 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:43,002 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:43,016 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 84 treesize of output 82 [2018-04-11 10:53:43,017 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 10:53:43,018 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:43,023 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:43,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:43,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2018-04-11 10:53:43,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-11 10:53:43,037 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:43,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 10:53:43,043 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:43,045 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:43,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:53:43,053 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 12 variables, input treesize:252, output treesize:19 [2018-04-11 10:53:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:53:43,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:53:43,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 21 [2018-04-11 10:53:43,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 10:53:43,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 10:53:43,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-04-11 10:53:43,095 INFO L87 Difference]: Start difference. First operand 506 states and 630 transitions. Second operand 22 states. [2018-04-11 10:53:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:53:45,765 INFO L93 Difference]: Finished difference Result 1134 states and 1339 transitions. [2018-04-11 10:53:45,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 10:53:45,766 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-04-11 10:53:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:53:45,766 INFO L225 Difference]: With dead ends: 1134 [2018-04-11 10:53:45,766 INFO L226 Difference]: Without dead ends: 1134 [2018-04-11 10:53:45,767 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=368, Invalid=1524, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 10:53:45,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2018-04-11 10:53:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 539. [2018-04-11 10:53:45,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-04-11 10:53:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 680 transitions. [2018-04-11 10:53:45,770 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 680 transitions. Word has length 61 [2018-04-11 10:53:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:53:45,770 INFO L459 AbstractCegarLoop]: Abstraction has 539 states and 680 transitions. [2018-04-11 10:53:45,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 10:53:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 680 transitions. [2018-04-11 10:53:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 10:53:45,771 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:53:45,771 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:53:45,771 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:53:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1015561329, now seen corresponding path program 1 times [2018-04-11 10:53:45,771 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:53:45,771 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:53:45,771 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:45,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:45,772 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:45,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:53:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 10:53:45,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:53:45,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:53:45,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:53:45,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:53:45,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:53:45,800 INFO L87 Difference]: Start difference. First operand 539 states and 680 transitions. Second operand 6 states. [2018-04-11 10:53:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:53:45,933 INFO L93 Difference]: Finished difference Result 540 states and 677 transitions. [2018-04-11 10:53:45,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:53:45,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-04-11 10:53:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:53:45,934 INFO L225 Difference]: With dead ends: 540 [2018-04-11 10:53:45,934 INFO L226 Difference]: Without dead ends: 540 [2018-04-11 10:53:45,934 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:53:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-04-11 10:53:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 539. [2018-04-11 10:53:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-04-11 10:53:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 677 transitions. [2018-04-11 10:53:45,937 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 677 transitions. Word has length 61 [2018-04-11 10:53:45,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:53:45,937 INFO L459 AbstractCegarLoop]: Abstraction has 539 states and 677 transitions. [2018-04-11 10:53:45,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:53:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 677 transitions. [2018-04-11 10:53:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 10:53:45,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:53:45,937 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:53:45,937 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:53:45,937 INFO L82 PathProgramCache]: Analyzing trace with hash 972744023, now seen corresponding path program 1 times [2018-04-11 10:53:45,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:53:45,938 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:53:45,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:45,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:45,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:45,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:53:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:53:45,983 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:53:45,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:53:45,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:53:45,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:53:45,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:53:45,983 INFO L87 Difference]: Start difference. First operand 539 states and 677 transitions. Second operand 6 states. [2018-04-11 10:53:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:53:46,270 INFO L93 Difference]: Finished difference Result 938 states and 1177 transitions. [2018-04-11 10:53:46,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:53:46,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-04-11 10:53:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:53:46,270 INFO L225 Difference]: With dead ends: 938 [2018-04-11 10:53:46,270 INFO L226 Difference]: Without dead ends: 938 [2018-04-11 10:53:46,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:53:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-04-11 10:53:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 546. [2018-04-11 10:53:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-04-11 10:53:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 686 transitions. [2018-04-11 10:53:46,274 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 686 transitions. Word has length 61 [2018-04-11 10:53:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:53:46,274 INFO L459 AbstractCegarLoop]: Abstraction has 546 states and 686 transitions. [2018-04-11 10:53:46,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:53:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 686 transitions. [2018-04-11 10:53:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 10:53:46,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:53:46,274 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:53:46,274 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 10:53:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash 972744024, now seen corresponding path program 1 times [2018-04-11 10:53:46,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:53:46,274 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:53:46,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:46,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:46,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:53:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:46,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:53:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:53:46,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:53:46,732 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:53:46,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:53:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:53:46,764 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:53:46,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:46,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:46,781 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 10:53:46,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:10 [2018-04-11 10:53:46,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 10:53:46,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 10:53:46,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 10:53:46,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 10:53:46,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 10:53:46,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,830 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 10:53:46,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:21 [2018-04-11 10:53:46,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:46,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:46,852 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 10:53:46,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-04-11 10:53:46,886 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 22 treesize of output 17 [2018-04-11 10:53:46,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 27 [2018-04-11 10:53:46,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:53:46,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,902 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 10:53:46,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-11 10:53:46,925 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 10:53:46,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 10:53:46,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,941 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 10:53:46,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-11 10:53:46,968 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 38 treesize of output 37 [2018-04-11 10:53:46,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:46,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 10:53:46,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:46,982 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 10:53:46,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-04-11 10:53:47,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:47,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:47,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:53:47,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:47,016 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 10:53:47,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:47 [2018-04-11 10:53:47,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-04-11 10:53:47,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:47,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:47,045 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:47,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 10:53:47,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:47,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:53:47,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 10:53:47,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:53 [2018-04-11 10:53:47,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 78 [2018-04-11 10:53:47,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:47,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:47,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:47,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 92 [2018-04-11 10:53:47,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-04-11 10:53:47,204 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 75 treesize of output 74 [2018-04-11 10:53:47,204 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:47,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 10:53:47,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-11 10:53:47,263 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:93, output treesize:221 [2018-04-11 10:53:47,808 WARN L148 SmtUtils]: Spent 426ms on a formula simplification that was a NOOP. DAG size: 79 [2018-04-11 10:53:47,815 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 68 treesize of output 67 [2018-04-11 10:53:47,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:47,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 59 [2018-04-11 10:53:47,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:47,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-11 10:53:47,818 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:47,818 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 56 treesize of output 55 [2018-04-11 10:53:47,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:47,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-11 10:53:47,848 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:245, output treesize:241 [2018-04-11 10:53:48,348 WARN L148 SmtUtils]: Spent 461ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-11 10:53:48,811 WARN L148 SmtUtils]: Spent 423ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-11 10:53:49,338 WARN L148 SmtUtils]: Spent 461ms on a formula simplification that was a NOOP. DAG size: 87 [2018-04-11 10:53:49,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:49,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 95 [2018-04-11 10:53:49,357 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 97 treesize of output 96 [2018-04-11 10:53:49,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:49,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:49,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:49,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:49,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 110 [2018-04-11 10:53:49,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 10:53:49,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 10:53:49,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:49,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 89 [2018-04-11 10:53:49,623 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 85 treesize of output 84 [2018-04-11 10:53:49,623 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:49,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:49,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 83 [2018-04-11 10:53:49,679 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-11 10:53:49,725 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:53:49,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:49,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 93 [2018-04-11 10:53:49,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:49,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 99 [2018-04-11 10:53:49,903 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-11 10:53:49,971 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 77 treesize of output 76 [2018-04-11 10:53:49,971 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:50,006 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:53:50,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:50,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 93 [2018-04-11 10:53:50,180 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 89 treesize of output 88 [2018-04-11 10:53:50,180 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:50,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:53:50,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 87 [2018-04-11 10:53:50,230 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-11 10:53:50,269 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:53:50,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 17 dim-0 vars, and 13 xjuncts. [2018-04-11 10:53:50,447 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:325, output treesize:741 [2018-04-11 10:53:54,563 WARN L151 SmtUtils]: Spent 4016ms on a formula simplification. DAG size of input: 154 DAG size of output 130 [2018-04-11 10:53:57,078 WARN L148 SmtUtils]: Spent 2407ms on a formula simplification that was a NOOP. DAG size: 137 [2018-04-11 10:53:57,090 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 162 treesize of output 163 [2018-04-11 10:53:57,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 10:53:57,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:53:57,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. Received shutdown request... [2018-04-11 10:53:57,763 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 10:53:57,763 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 10:53:57,767 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 10:53:57,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 10:53:57 BoogieIcfgContainer [2018-04-11 10:53:57,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 10:53:57,767 INFO L168 Benchmark]: Toolchain (without parser) took 194163.68 ms. Allocated memory was 403.7 MB in the beginning and 621.8 MB in the end (delta: 218.1 MB). Free memory was 337.0 MB in the beginning and 445.8 MB in the end (delta: -108.8 MB). Peak memory consumption was 109.3 MB. Max. memory is 5.3 GB. [2018-04-11 10:53:57,768 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 403.7 MB. Free memory is still 364.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 10:53:57,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.58 ms. Allocated memory is still 403.7 MB. Free memory was 337.0 MB in the beginning and 311.8 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-11 10:53:57,768 INFO L168 Benchmark]: Boogie Preprocessor took 52.82 ms. Allocated memory is still 403.7 MB. Free memory was 311.8 MB in the beginning and 307.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-11 10:53:57,768 INFO L168 Benchmark]: RCFGBuilder took 633.84 ms. Allocated memory was 403.7 MB in the beginning and 591.9 MB in the end (delta: 188.2 MB). Free memory was 307.8 MB in the beginning and 493.5 MB in the end (delta: -185.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. [2018-04-11 10:53:57,769 INFO L168 Benchmark]: TraceAbstraction took 193194.77 ms. Allocated memory was 591.9 MB in the beginning and 621.8 MB in the end (delta: 29.9 MB). Free memory was 493.5 MB in the beginning and 445.8 MB in the end (delta: 47.7 MB). Peak memory consumption was 77.5 MB. Max. memory is 5.3 GB. [2018-04-11 10:53:57,769 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 403.7 MB. Free memory is still 364.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 279.58 ms. Allocated memory is still 403.7 MB. Free memory was 337.0 MB in the beginning and 311.8 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 52.82 ms. Allocated memory is still 403.7 MB. Free memory was 311.8 MB in the beginning and 307.8 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 633.84 ms. Allocated memory was 403.7 MB in the beginning and 591.9 MB in the end (delta: 188.2 MB). Free memory was 307.8 MB in the beginning and 493.5 MB in the end (delta: -185.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 193194.77 ms. Allocated memory was 591.9 MB in the beginning and 621.8 MB in the end (delta: 29.9 MB). Free memory was 493.5 MB in the beginning and 445.8 MB in the end (delta: 47.7 MB). Peak memory consumption was 77.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 698]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 694]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 703]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 723]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 723]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 703]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 698]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 694]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 62 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 320. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 226 locations, 101 error locations. TIMEOUT Result, 193.1s OverallTime, 69 OverallIterations, 3 TraceHistogramMax, 146.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12846 SDtfs, 57227 SDslu, 67275 SDs, 0 SdLazy, 68056 SolverSat, 4137 SolverUnsat, 52 SolverUnknown, 0 SolverNotchecked, 114.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2272 GetRequests, 795 SyntacticMatches, 50 SemanticMatches, 1427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12097 ImplicationChecksByTransitivity, 50.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=590occurred in iteration=45, 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.3s AutomataMinimizationTime, 68 MinimizatonAttempts, 17762 StatesRemovedByMinimization, 59 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 3594 NumberOfCodeBlocks, 3594 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 3508 ConstructedInterpolants, 232 QuantifiedInterpolants, 3251420 SizeOfPredicates, 354 NumberOfNonLiveVariables, 3873 ConjunctsInSsa, 711 ConjunctsInUnsatCore, 86 InterpolantComputations, 52 PerfectInterpolantSequences, 62/200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_10-53-57-775.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_10-53-57-775.csv Completed graceful shutdown