java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d4a2356 [2018-03-23 12:00:03,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-23 12:00:03,036 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-23 12:00:03,053 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-23 12:00:03,053 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-23 12:00:03,054 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-23 12:00:03,055 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-23 12:00:03,057 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-23 12:00:03,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-23 12:00:03,060 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-23 12:00:03,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-23 12:00:03,061 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-23 12:00:03,062 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-23 12:00:03,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-23 12:00:03,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-23 12:00:03,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-23 12:00:03,069 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-23 12:00:03,071 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-23 12:00:03,072 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-23 12:00:03,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-23 12:00:03,076 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-23 12:00:03,077 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-23 12:00:03,077 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-23 12:00:03,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-23 12:00:03,079 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-23 12:00:03,080 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-23 12:00:03,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-23 12:00:03,081 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-23 12:00:03,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-23 12:00:03,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-23 12:00:03,083 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-23 12:00:03,083 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-03-23 12:00:03,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-23 12:00:03,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-23 12:00:03,093 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-23 12:00:03,094 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-23 12:00:03,094 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-23 12:00:03,094 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-23 12:00:03,094 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-23 12:00:03,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-23 12:00:03,095 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-23 12:00:03,095 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-23 12:00:03,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-23 12:00:03,095 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-23 12:00:03,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-23 12:00:03,095 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-23 12:00:03,095 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-03-23 12:00:03,096 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-23 12:00:03,096 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-23 12:00:03,096 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-23 12:00:03,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-23 12:00:03,096 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-23 12:00:03,096 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-03-23 12:00:03,096 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-23 12:00:03,097 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-23 12:00:03,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 12:00:03,097 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-23 12:00:03,097 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-23 12:00:03,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-23 12:00:03,098 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-23 12:00:03,098 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-03-23 12:00:03,098 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-23 12:00:03,098 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-23 12:00:03,098 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-23 12:00:03,099 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-23 12:00:03,099 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-23 12:00:03,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-23 12:00:03,141 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-23 12:00:03,144 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-23 12:00:03,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-23 12:00:03,146 INFO L276 PluginConnector]: CDTParser initialized [2018-03-23 12:00:03,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,459 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGdf2cf5a89 [2018-03-23 12:00:03,641 INFO L291 CDTParser]: IsIndexed: true [2018-03-23 12:00:03,641 INFO L292 CDTParser]: Found 1 translation units. [2018-03-23 12:00:03,642 INFO L171 CDTParser]: Scanning sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,652 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-23 12:00:03,652 INFO L215 ultiparseSymbolTable]: [2018-03-23 12:00:03,652 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-23 12:00:03,652 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,652 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_once_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsword_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint64_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__nlink_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__Colour in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__uint in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__loff_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uid_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int64_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,653 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__gid_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ssize_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____nlink_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int32_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____daddr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__timer_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____ssize_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fsid_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fd_mask in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,654 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int8_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__clockid_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____loff_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____clock_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int8_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fd_mask in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,655 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int64_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__key_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__idtype_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____off_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int8_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____ino64_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,656 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint8_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ino_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int64_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____time_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____key_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ushort in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_int in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,657 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ldiv_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____useconds_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__dev_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__id_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__register_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,658 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_key_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__time_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____blkcnt_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_quad_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____caddr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__sigset_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_char in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____off64_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,659 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__ulong in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__clock_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__fd_set in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint16_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____rlim64_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__mode_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____qaddr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,660 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____dev_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,661 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____blksize_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,661 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,661 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____gid_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,661 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____id_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,661 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int32_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,661 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,661 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__daddr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,661 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int32_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,661 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,661 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____pid_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,662 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____timer_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,662 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____sigset_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,662 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_short in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,662 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____ino_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,662 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,662 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____mode_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,662 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__suseconds_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,662 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____quad_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,662 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____fsid_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,663 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__caddr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,663 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____rlim_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,663 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_long in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,663 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pid_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,663 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,663 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_quad_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,663 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____suseconds_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,663 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__SLL in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,663 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__off_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____int16_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_short in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____uint32_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__uid_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__wchar_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____socklen_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__lldiv_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_int16_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__blkcnt_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__quad_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__int16_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__blksize_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____clockid_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__div_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____u_long in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i____intptr_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__u_char in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_rb_sentinel_true_unreach_call_true_valid_memsafety_i__size_t in sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:03,686 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGdf2cf5a89 [2018-03-23 12:00:03,691 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-23 12:00:03,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-23 12:00:03,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-23 12:00:03,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-23 12:00:03,698 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-23 12:00:03,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 12:00:03" (1/1) ... [2018-03-23 12:00:03,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a115b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:03, skipping insertion in model container [2018-03-23 12:00:03,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 12:00:03" (1/1) ... [2018-03-23 12:00:03,715 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 12:00:03,747 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 12:00:03,920 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 12:00:03,983 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 12:00:03,990 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-03-23 12:00:04,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:04 WrapperNode [2018-03-23 12:00:04,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-23 12:00:04,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-23 12:00:04,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-23 12:00:04,042 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-23 12:00:04,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:04" (1/1) ... [2018-03-23 12:00:04,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:04" (1/1) ... [2018-03-23 12:00:04,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:04" (1/1) ... [2018-03-23 12:00:04,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:04" (1/1) ... [2018-03-23 12:00:04,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:04" (1/1) ... [2018-03-23 12:00:04,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:04" (1/1) ... [2018-03-23 12:00:04,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:04" (1/1) ... [2018-03-23 12:00:04,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-23 12:00:04,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-23 12:00:04,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-23 12:00:04,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-23 12:00:04,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 12:00:04,224 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-23 12:00:04,224 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-23 12:00:04,225 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-23 12:00:04,225 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-03-23 12:00:04,225 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-03-23 12:00:04,225 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-03-23 12:00:04,225 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-03-23 12:00:04,225 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-03-23 12:00:04,225 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-03-23 12:00:04,226 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-03-23 12:00:04,226 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-03-23 12:00:04,226 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-03-23 12:00:04,226 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-03-23 12:00:04,226 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-03-23 12:00:04,226 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-03-23 12:00:04,226 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-03-23 12:00:04,227 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-03-23 12:00:04,227 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-03-23 12:00:04,227 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-03-23 12:00:04,227 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-03-23 12:00:04,227 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-03-23 12:00:04,227 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-03-23 12:00:04,228 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-03-23 12:00:04,228 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-03-23 12:00:04,228 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-03-23 12:00:04,228 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-03-23 12:00:04,228 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-03-23 12:00:04,228 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-03-23 12:00:04,229 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-03-23 12:00:04,229 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-03-23 12:00:04,229 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-03-23 12:00:04,229 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-03-23 12:00:04,229 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-03-23 12:00:04,229 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-03-23 12:00:04,229 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-03-23 12:00:04,229 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-03-23 12:00:04,229 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-03-23 12:00:04,230 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-03-23 12:00:04,230 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-03-23 12:00:04,230 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-03-23 12:00:04,230 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-03-23 12:00:04,230 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-03-23 12:00:04,230 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-03-23 12:00:04,230 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-03-23 12:00:04,230 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-03-23 12:00:04,230 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-03-23 12:00:04,231 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-03-23 12:00:04,231 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-03-23 12:00:04,231 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-03-23 12:00:04,231 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-03-23 12:00:04,231 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-03-23 12:00:04,231 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-03-23 12:00:04,231 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-03-23 12:00:04,231 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-23 12:00:04,231 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-03-23 12:00:04,231 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-03-23 12:00:04,232 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-23 12:00:04,232 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-03-23 12:00:04,232 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-03-23 12:00:04,232 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-03-23 12:00:04,232 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-03-23 12:00:04,232 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-03-23 12:00:04,232 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-03-23 12:00:04,232 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-03-23 12:00:04,232 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-03-23 12:00:04,233 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-03-23 12:00:04,234 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-03-23 12:00:04,235 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-03-23 12:00:04,235 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-03-23 12:00:04,235 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-03-23 12:00:04,235 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-03-23 12:00:04,235 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-03-23 12:00:04,235 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-03-23 12:00:04,235 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-03-23 12:00:04,235 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-03-23 12:00:04,235 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-03-23 12:00:04,236 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-03-23 12:00:04,236 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-03-23 12:00:04,236 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-03-23 12:00:04,236 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-03-23 12:00:04,236 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-03-23 12:00:04,236 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-03-23 12:00:04,236 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-03-23 12:00:04,237 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-03-23 12:00:04,237 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-03-23 12:00:04,237 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-23 12:00:04,237 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-23 12:00:04,237 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-23 12:00:04,237 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-03-23 12:00:04,237 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-03-23 12:00:04,237 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-23 12:00:04,238 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-23 12:00:04,238 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-23 12:00:04,238 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-23 12:00:04,238 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-23 12:00:04,862 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-23 12:00:04,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 12:00:04 BoogieIcfgContainer [2018-03-23 12:00:04,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-23 12:00:04,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-23 12:00:04,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-23 12:00:04,865 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-23 12:00:04,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 12:00:03" (1/3) ... [2018-03-23 12:00:04,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e23b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 12:00:04, skipping insertion in model container [2018-03-23 12:00:04,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 12:00:04" (2/3) ... [2018-03-23 12:00:04,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e23b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 12:00:04, skipping insertion in model container [2018-03-23 12:00:04,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 12:00:04" (3/3) ... [2018-03-23 12:00:04,868 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-03-23 12:00:04,874 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-23 12:00:04,881 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-03-23 12:00:04,925 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-23 12:00:04,926 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-23 12:00:04,926 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-23 12:00:04,926 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-23 12:00:04,926 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-23 12:00:04,926 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-23 12:00:04,926 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-23 12:00:04,926 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-23 12:00:04,926 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-23 12:00:04,927 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-23 12:00:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2018-03-23 12:00:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-03-23 12:00:04,948 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:04,949 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:04,949 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:04,954 INFO L82 PathProgramCache]: Analyzing trace with hash -107664408, now seen corresponding path program 1 times [2018-03-23 12:00:04,956 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:04,956 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:04,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:04,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:04,999 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:05,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:05,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:05,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 12:00:05,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-23 12:00:05,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-23 12:00:05,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-23 12:00:05,129 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 4 states. [2018-03-23 12:00:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:05,437 INFO L93 Difference]: Finished difference Result 289 states and 330 transitions. [2018-03-23 12:00:05,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-23 12:00:05,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-03-23 12:00:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:05,449 INFO L225 Difference]: With dead ends: 289 [2018-03-23 12:00:05,449 INFO L226 Difference]: Without dead ends: 182 [2018-03-23 12:00:05,454 INFO L568 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-03-23 12:00:05,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-03-23 12:00:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 154. [2018-03-23 12:00:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-03-23 12:00:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2018-03-23 12:00:05,500 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 9 [2018-03-23 12:00:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:05,501 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2018-03-23 12:00:05,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-23 12:00:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2018-03-23 12:00:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-03-23 12:00:05,502 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:05,502 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:05,502 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:05,502 INFO L82 PathProgramCache]: Analyzing trace with hash -107664407, now seen corresponding path program 1 times [2018-03-23 12:00:05,502 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:05,503 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:05,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:05,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:05,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:05,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:05,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:05,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 12:00:05,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-23 12:00:05,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-23 12:00:05,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-23 12:00:05,607 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 4 states. [2018-03-23 12:00:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:05,759 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-03-23 12:00:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-23 12:00:05,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-03-23 12:00:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:05,761 INFO L225 Difference]: With dead ends: 154 [2018-03-23 12:00:05,761 INFO L226 Difference]: Without dead ends: 151 [2018-03-23 12:00:05,762 INFO L568 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-03-23 12:00:05,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-03-23 12:00:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-03-23 12:00:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-03-23 12:00:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 157 transitions. [2018-03-23 12:00:05,772 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 157 transitions. Word has length 9 [2018-03-23 12:00:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:05,773 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 157 transitions. [2018-03-23 12:00:05,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-23 12:00:05,773 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 157 transitions. [2018-03-23 12:00:05,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-03-23 12:00:05,774 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:05,774 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:05,774 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:05,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1849512404, now seen corresponding path program 1 times [2018-03-23 12:00:05,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:05,774 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:05,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:05,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:05,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:05,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:05,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:05,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 12:00:05,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-23 12:00:05,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-23 12:00:05,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-23 12:00:05,836 INFO L87 Difference]: Start difference. First operand 151 states and 157 transitions. Second operand 4 states. [2018-03-23 12:00:05,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:05,990 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2018-03-23 12:00:05,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 12:00:05,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-03-23 12:00:05,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:05,992 INFO L225 Difference]: With dead ends: 174 [2018-03-23 12:00:05,992 INFO L226 Difference]: Without dead ends: 167 [2018-03-23 12:00:05,992 INFO L568 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-03-23 12:00:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-03-23 12:00:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2018-03-23 12:00:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-03-23 12:00:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2018-03-23 12:00:06,002 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 13 [2018-03-23 12:00:06,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:06,002 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2018-03-23 12:00:06,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-23 12:00:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2018-03-23 12:00:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-03-23 12:00:06,003 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:06,003 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:06,003 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:06,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1849512403, now seen corresponding path program 1 times [2018-03-23 12:00:06,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:06,004 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:06,005 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:06,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:06,006 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:06,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:06,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:06,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 12:00:06,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-23 12:00:06,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-23 12:00:06,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-23 12:00:06,057 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand 4 states. [2018-03-23 12:00:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:06,152 INFO L93 Difference]: Finished difference Result 175 states and 181 transitions. [2018-03-23 12:00:06,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-23 12:00:06,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-03-23 12:00:06,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:06,154 INFO L225 Difference]: With dead ends: 175 [2018-03-23 12:00:06,154 INFO L226 Difference]: Without dead ends: 168 [2018-03-23 12:00:06,154 INFO L568 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-03-23 12:00:06,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-03-23 12:00:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2018-03-23 12:00:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-03-23 12:00:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2018-03-23 12:00:06,168 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 13 [2018-03-23 12:00:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:06,169 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2018-03-23 12:00:06,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-23 12:00:06,169 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2018-03-23 12:00:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-23 12:00:06,170 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:06,170 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:06,170 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:06,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1366631277, now seen corresponding path program 1 times [2018-03-23 12:00:06,170 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:06,170 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:06,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:06,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:06,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:06,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:06,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:06,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-03-23 12:00:06,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 12:00:06,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 12:00:06,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 12:00:06,304 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 5 states. [2018-03-23 12:00:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:06,463 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2018-03-23 12:00:06,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-23 12:00:06,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-03-23 12:00:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:06,465 INFO L225 Difference]: With dead ends: 178 [2018-03-23 12:00:06,465 INFO L226 Difference]: Without dead ends: 166 [2018-03-23 12:00:06,466 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-23 12:00:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-03-23 12:00:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 147. [2018-03-23 12:00:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-03-23 12:00:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-03-23 12:00:06,477 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 21 [2018-03-23 12:00:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:06,477 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-03-23 12:00:06,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 12:00:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-03-23 12:00:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-23 12:00:06,478 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:06,478 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:06,478 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1366631276, now seen corresponding path program 1 times [2018-03-23 12:00:06,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:06,478 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:06,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:06,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:06,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:06,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:06,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:06,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-03-23 12:00:06,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 12:00:06,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 12:00:06,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 12:00:06,557 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 5 states. [2018-03-23 12:00:06,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:06,696 INFO L93 Difference]: Finished difference Result 198 states and 208 transitions. [2018-03-23 12:00:06,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 12:00:06,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-03-23 12:00:06,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:06,698 INFO L225 Difference]: With dead ends: 198 [2018-03-23 12:00:06,698 INFO L226 Difference]: Without dead ends: 192 [2018-03-23 12:00:06,698 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-23 12:00:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-03-23 12:00:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 158. [2018-03-23 12:00:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-03-23 12:00:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2018-03-23 12:00:06,707 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 21 [2018-03-23 12:00:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:06,707 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2018-03-23 12:00:06,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 12:00:06,708 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2018-03-23 12:00:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-23 12:00:06,708 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:06,708 INFO L353 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-03-23 12:00:06,708 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:06,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2111287447, now seen corresponding path program 1 times [2018-03-23 12:00:06,709 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:06,709 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:06,710 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:06,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:06,710 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:06,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:06,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:06,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 12:00:06,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 12:00:06,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 12:00:06,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-23 12:00:06,797 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand 6 states. [2018-03-23 12:00:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:07,083 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2018-03-23 12:00:07,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-23 12:00:07,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-03-23 12:00:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:07,088 INFO L225 Difference]: With dead ends: 250 [2018-03-23 12:00:07,088 INFO L226 Difference]: Without dead ends: 249 [2018-03-23 12:00:07,089 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-03-23 12:00:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-03-23 12:00:07,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 157. [2018-03-23 12:00:07,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-03-23 12:00:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2018-03-23 12:00:07,097 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 25 [2018-03-23 12:00:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:07,098 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2018-03-23 12:00:07,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 12:00:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2018-03-23 12:00:07,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-23 12:00:07,099 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:07,099 INFO L353 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-03-23 12:00:07,099 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:07,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2111287448, now seen corresponding path program 1 times [2018-03-23 12:00:07,100 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:07,100 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:07,101 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:07,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:07,101 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:07,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:07,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:07,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 12:00:07,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 12:00:07,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 12:00:07,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-23 12:00:07,215 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 6 states. [2018-03-23 12:00:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:07,476 INFO L93 Difference]: Finished difference Result 271 states and 289 transitions. [2018-03-23 12:00:07,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 12:00:07,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-03-23 12:00:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:07,478 INFO L225 Difference]: With dead ends: 271 [2018-03-23 12:00:07,479 INFO L226 Difference]: Without dead ends: 264 [2018-03-23 12:00:07,479 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-03-23 12:00:07,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-03-23 12:00:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 152. [2018-03-23 12:00:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-03-23 12:00:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2018-03-23 12:00:07,489 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 25 [2018-03-23 12:00:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:07,489 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2018-03-23 12:00:07,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 12:00:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2018-03-23 12:00:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-03-23 12:00:07,493 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:07,493 INFO L353 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-03-23 12:00:07,493 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1496016454, now seen corresponding path program 1 times [2018-03-23 12:00:07,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:07,493 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:07,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:07,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:07,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:07,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:07,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:07,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 12:00:07,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 12:00:07,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 12:00:07,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-23 12:00:07,562 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 6 states. [2018-03-23 12:00:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:07,783 INFO L93 Difference]: Finished difference Result 269 states and 292 transitions. [2018-03-23 12:00:07,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-23 12:00:07,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-03-23 12:00:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:07,785 INFO L225 Difference]: With dead ends: 269 [2018-03-23 12:00:07,785 INFO L226 Difference]: Without dead ends: 268 [2018-03-23 12:00:07,786 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-03-23 12:00:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-03-23 12:00:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 151. [2018-03-23 12:00:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-03-23 12:00:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-03-23 12:00:07,792 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 35 [2018-03-23 12:00:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:07,793 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-03-23 12:00:07,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 12:00:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-03-23 12:00:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-03-23 12:00:07,794 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:07,794 INFO L353 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-03-23 12:00:07,794 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1496016455, now seen corresponding path program 1 times [2018-03-23 12:00:07,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:07,794 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:07,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:07,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:07,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:07,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:07,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:07,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 12:00:07,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 12:00:07,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 12:00:07,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-23 12:00:07,968 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 6 states. [2018-03-23 12:00:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:08,221 INFO L93 Difference]: Finished difference Result 273 states and 292 transitions. [2018-03-23 12:00:08,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-23 12:00:08,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-03-23 12:00:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:08,223 INFO L225 Difference]: With dead ends: 273 [2018-03-23 12:00:08,223 INFO L226 Difference]: Without dead ends: 269 [2018-03-23 12:00:08,223 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-03-23 12:00:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-03-23 12:00:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 140. [2018-03-23 12:00:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-03-23 12:00:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-03-23 12:00:08,232 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 35 [2018-03-23 12:00:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:08,232 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-03-23 12:00:08,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 12:00:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-03-23 12:00:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-03-23 12:00:08,234 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:08,234 INFO L353 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-03-23 12:00:08,234 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash 421898442, now seen corresponding path program 1 times [2018-03-23 12:00:08,234 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:08,234 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:08,236 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:08,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:08,236 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:08,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:08,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:08,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-03-23 12:00:08,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-23 12:00:08,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-23 12:00:08,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-03-23 12:00:08,304 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 8 states. [2018-03-23 12:00:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:08,477 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2018-03-23 12:00:08,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-23 12:00:08,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-03-23 12:00:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:08,478 INFO L225 Difference]: With dead ends: 222 [2018-03-23 12:00:08,478 INFO L226 Difference]: Without dead ends: 165 [2018-03-23 12:00:08,478 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-03-23 12:00:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-03-23 12:00:08,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 140. [2018-03-23 12:00:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-03-23 12:00:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2018-03-23 12:00:08,486 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 38 [2018-03-23 12:00:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:08,486 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2018-03-23 12:00:08,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-23 12:00:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-03-23 12:00:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-23 12:00:08,487 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:08,488 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:08,488 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 635022001, now seen corresponding path program 1 times [2018-03-23 12:00:08,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:08,488 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:08,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:08,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:08,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:08,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:08,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:08,640 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:08,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:08,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:08,763 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-03-23 12:00:08,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-03-23 12:00:08,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:08,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:08,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:08,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-03-23 12:00:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:08,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 12:00:08,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-03-23 12:00:08,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 12:00:08,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 12:00:08,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-03-23 12:00:08,816 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 9 states. [2018-03-23 12:00:09,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:09,344 INFO L93 Difference]: Finished difference Result 309 states and 326 transitions. [2018-03-23 12:00:09,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-03-23 12:00:09,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-03-23 12:00:09,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:09,346 INFO L225 Difference]: With dead ends: 309 [2018-03-23 12:00:09,346 INFO L226 Difference]: Without dead ends: 224 [2018-03-23 12:00:09,347 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-03-23 12:00:09,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-03-23 12:00:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 138. [2018-03-23 12:00:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-03-23 12:00:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2018-03-23 12:00:09,356 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 40 [2018-03-23 12:00:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:09,357 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2018-03-23 12:00:09,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 12:00:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2018-03-23 12:00:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-03-23 12:00:09,358 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:09,358 INFO L353 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-03-23 12:00:09,359 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:09,359 INFO L82 PathProgramCache]: Analyzing trace with hash -656176642, now seen corresponding path program 1 times [2018-03-23 12:00:09,359 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:09,359 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:09,361 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:09,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:09,361 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:09,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:09,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 12:00:09,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-03-23 12:00:09,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 12:00:09,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 12:00:09,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-03-23 12:00:09,474 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand 6 states. [2018-03-23 12:00:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:09,778 INFO L93 Difference]: Finished difference Result 252 states and 264 transitions. [2018-03-23 12:00:09,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 12:00:09,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-03-23 12:00:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:09,779 INFO L225 Difference]: With dead ends: 252 [2018-03-23 12:00:09,779 INFO L226 Difference]: Without dead ends: 148 [2018-03-23 12:00:09,780 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-03-23 12:00:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-03-23 12:00:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2018-03-23 12:00:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-03-23 12:00:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2018-03-23 12:00:09,786 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 42 [2018-03-23 12:00:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:09,786 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2018-03-23 12:00:09,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 12:00:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2018-03-23 12:00:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-23 12:00:09,787 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:09,787 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:09,787 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash 186522450, now seen corresponding path program 1 times [2018-03-23 12:00:09,787 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:09,788 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:09,788 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:09,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:09,789 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:09,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:09,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:09,994 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:10,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:10,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:10,043 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:10,044 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:10,046 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-03-23 12:00:10,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:10,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:10,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-03-23 12:00:10,097 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-03-23 12:00:10,100 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-03-23 12:00:10,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:10,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:10,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:10,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-03-23 12:00:10,245 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 37 treesize of output 33 [2018-03-23 12:00:10,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:10,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:10,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:10,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:10,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2018-03-23 12:00:10,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-03-23 12:00:10,323 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-03-23 12:00:10,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:10,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:10,349 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-03-23 12:00:10,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2018-03-23 12:00:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:10,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:10,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-03-23 12:00:10,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-23 12:00:10,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-23 12:00:10,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-03-23 12:00:10,501 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand 21 states. [2018-03-23 12:00:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:11,257 INFO L93 Difference]: Finished difference Result 265 states and 280 transitions. [2018-03-23 12:00:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-03-23 12:00:11,257 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 56 [2018-03-23 12:00:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:11,258 INFO L225 Difference]: With dead ends: 265 [2018-03-23 12:00:11,258 INFO L226 Difference]: Without dead ends: 264 [2018-03-23 12:00:11,259 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=672, Unknown=0, NotChecked=0, Total=870 [2018-03-23 12:00:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-03-23 12:00:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 179. [2018-03-23 12:00:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-03-23 12:00:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 189 transitions. [2018-03-23 12:00:11,271 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 189 transitions. Word has length 56 [2018-03-23 12:00:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:11,272 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 189 transitions. [2018-03-23 12:00:11,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-23 12:00:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 189 transitions. [2018-03-23 12:00:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-03-23 12:00:11,273 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:11,273 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:11,273 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:11,273 INFO L82 PathProgramCache]: Analyzing trace with hash 186522451, now seen corresponding path program 1 times [2018-03-23 12:00:11,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:11,273 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:11,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:11,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:11,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:11,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:11,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:11,475 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:11,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:11,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:11,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 12:00:11,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,601 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:11,601 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:11,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-03-23 12:00:11,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-03-23 12:00:11,631 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-03-23 12:00:11,633 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-03-23 12:00:11,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,663 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-03-23 12:00:11,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:11,667 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,669 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,677 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:34 [2018-03-23 12:00:11,748 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 27 treesize of output 28 [2018-03-23 12:00:11,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:11,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-03-23 12:00:11,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 12:00:11,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:11,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:36 [2018-03-23 12:00:11,848 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-03-23 12:00:11,854 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 17 [2018-03-23 12:00:11,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,867 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 22 treesize of output 20 [2018-03-23 12:00:11,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-23 12:00:11,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,873 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-03-23 12:00:11,873 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:11,878 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:50, output treesize:9 [2018-03-23 12:00:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:11,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:11,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2018-03-23 12:00:11,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-03-23 12:00:11,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-03-23 12:00:11,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2018-03-23 12:00:11,928 INFO L87 Difference]: Start difference. First operand 179 states and 189 transitions. Second operand 22 states. [2018-03-23 12:00:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:12,884 INFO L93 Difference]: Finished difference Result 258 states and 270 transitions. [2018-03-23 12:00:12,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-03-23 12:00:12,885 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2018-03-23 12:00:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:12,886 INFO L225 Difference]: With dead ends: 258 [2018-03-23 12:00:12,886 INFO L226 Difference]: Without dead ends: 256 [2018-03-23 12:00:12,887 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=298, Invalid=1184, Unknown=0, NotChecked=0, Total=1482 [2018-03-23 12:00:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-03-23 12:00:12,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 183. [2018-03-23 12:00:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-03-23 12:00:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 192 transitions. [2018-03-23 12:00:12,901 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 192 transitions. Word has length 56 [2018-03-23 12:00:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:12,902 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 192 transitions. [2018-03-23 12:00:12,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-03-23 12:00:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 192 transitions. [2018-03-23 12:00:12,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-03-23 12:00:12,903 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:12,903 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:12,903 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:12,903 INFO L82 PathProgramCache]: Analyzing trace with hash -915089334, now seen corresponding path program 1 times [2018-03-23 12:00:12,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:12,904 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:12,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:12,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:12,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:12,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:13,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:13,306 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:13,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:13,358 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:13,392 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:13,395 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:13,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-03-23 12:00:13,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-03-23 12:00:13,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, 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-03-23 12:00:13,413 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-03-23 12:00:13,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2018-03-23 12:00:13,492 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-03-23 12:00:13,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:13,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-03-23 12:00:13,554 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:13,555 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:13,556 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-03-23 12:00:13,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-03-23 12:00:13,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-03-23 12:00:13,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 12:00:13,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-03-23 12:00:13,856 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 57 treesize of output 61 [2018-03-23 12:00:13,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-03-23 12:00:13,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:13,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 45 [2018-03-23 12:00:13,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-03-23 12:00:13,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 12:00:14,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:00:14,004 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:49 [2018-03-23 12:00:14,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-03-23 12:00:14,177 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-03-23 12:00:14,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:14,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:14,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:14,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-03-23 12:00:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:14,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:14,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 22 [2018-03-23 12:00:14,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-03-23 12:00:14,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-03-23 12:00:14,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2018-03-23 12:00:14,330 INFO L87 Difference]: Start difference. First operand 183 states and 192 transitions. Second operand 23 states. [2018-03-23 12:00:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:15,549 INFO L93 Difference]: Finished difference Result 287 states and 301 transitions. [2018-03-23 12:00:15,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-03-23 12:00:15,549 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 63 [2018-03-23 12:00:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:15,551 INFO L225 Difference]: With dead ends: 287 [2018-03-23 12:00:15,551 INFO L226 Difference]: Without dead ends: 286 [2018-03-23 12:00:15,552 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=299, Invalid=1507, Unknown=0, NotChecked=0, Total=1806 [2018-03-23 12:00:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-03-23 12:00:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 219. [2018-03-23 12:00:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-03-23 12:00:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 230 transitions. [2018-03-23 12:00:15,570 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 230 transitions. Word has length 63 [2018-03-23 12:00:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:15,570 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 230 transitions. [2018-03-23 12:00:15,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-03-23 12:00:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 230 transitions. [2018-03-23 12:00:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-03-23 12:00:15,571 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:15,571 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:15,572 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:15,572 INFO L82 PathProgramCache]: Analyzing trace with hash -915089333, now seen corresponding path program 1 times [2018-03-23 12:00:15,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:15,572 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:15,573 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:15,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:15,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:15,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:16,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:16,036 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:16,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:16,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:16,176 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:16,177 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:16,177 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-03-23 12:00:16,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-03-23 12:00:16,212 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-03-23 12:00:16,215 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-03-23 12:00:16,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,230 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-03-23 12:00:16,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-23 12:00:16,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-03-23 12:00:16,340 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:16,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-03-23 12:00:16,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 12:00:16,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,368 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:16,371 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-03-23 12:00:16,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:16,373 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2018-03-23 12:00:16,462 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:16,463 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:16,463 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:16,464 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 20 treesize of output 21 [2018-03-23 12:00:16,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 21 [2018-03-23 12:00:16,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:75 [2018-03-23 12:00:16,553 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:16,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-03-23 12:00:16,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 12:00:16,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-03-23 12:00:16,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-03-23 12:00:16,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,610 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:69 [2018-03-23 12:00:16,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2018-03-23 12:00:16,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:00:16,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,764 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 35 treesize of output 36 [2018-03-23 12:00:16,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:00:16,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:16,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:125, output treesize:86 [2018-03-23 12:00:16,912 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 51 [2018-03-23 12:00:16,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-03-23 12:00:16,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-03-23 12:00:16,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:16,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:16,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-03-23 12:00:16,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-23 12:00:16,946 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,951 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-03-23 12:00:16,951 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,952 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:16,961 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-03-23 12:00:16,961 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:100, output treesize:18 [2018-03-23 12:00:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:17,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:17,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2018-03-23 12:00:17,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-03-23 12:00:17,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-03-23 12:00:17,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2018-03-23 12:00:17,067 INFO L87 Difference]: Start difference. First operand 219 states and 230 transitions. Second operand 34 states. [2018-03-23 12:00:18,207 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 54 DAG size of output 45 [2018-03-23 12:00:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:20,804 INFO L93 Difference]: Finished difference Result 351 states and 367 transitions. [2018-03-23 12:00:20,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-03-23 12:00:20,804 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 63 [2018-03-23 12:00:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:20,805 INFO L225 Difference]: With dead ends: 351 [2018-03-23 12:00:20,806 INFO L226 Difference]: Without dead ends: 349 [2018-03-23 12:00:20,807 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=641, Invalid=3649, Unknown=0, NotChecked=0, Total=4290 [2018-03-23 12:00:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-03-23 12:00:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 192. [2018-03-23 12:00:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-03-23 12:00:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 201 transitions. [2018-03-23 12:00:20,820 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 201 transitions. Word has length 63 [2018-03-23 12:00:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:20,820 INFO L459 AbstractCegarLoop]: Abstraction has 192 states and 201 transitions. [2018-03-23 12:00:20,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-03-23 12:00:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 201 transitions. [2018-03-23 12:00:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-03-23 12:00:20,821 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:20,821 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:20,821 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1264006943, now seen corresponding path program 1 times [2018-03-23 12:00:20,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:20,822 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:20,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:20,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:20,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:20,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:21,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:21,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:21,093 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:21,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:21,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:21,179 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:21,180 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:21,180 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-03-23 12:00:21,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-03-23 12:00:21,207 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-03-23 12:00:21,209 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-03-23 12:00:21,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,221 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-03-23 12:00:21,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 12:00:21,222 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,231 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-03-23 12:00:21,317 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 55 treesize of output 51 [2018-03-23 12:00:21,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:00:21,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,375 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 46 treesize of output 47 [2018-03-23 12:00:21,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:00:21,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,389 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:49 [2018-03-23 12:00:21,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-03-23 12:00:21,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-03-23 12:00:21,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-03-23 12:00:21,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:21,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:21,569 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 30 treesize of output 24 [2018-03-23 12:00:21,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-03-23 12:00:21,571 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,576 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-03-23 12:00:21,576 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:21,582 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:79, output treesize:10 [2018-03-23 12:00:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:21,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:21,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-03-23 12:00:21,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-03-23 12:00:21,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-03-23 12:00:21,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2018-03-23 12:00:21,693 INFO L87 Difference]: Start difference. First operand 192 states and 201 transitions. Second operand 28 states. [2018-03-23 12:00:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:23,150 INFO L93 Difference]: Finished difference Result 349 states and 365 transitions. [2018-03-23 12:00:23,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-03-23 12:00:23,151 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 65 [2018-03-23 12:00:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:23,152 INFO L225 Difference]: With dead ends: 349 [2018-03-23 12:00:23,152 INFO L226 Difference]: Without dead ends: 266 [2018-03-23 12:00:23,153 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=420, Invalid=2232, Unknown=0, NotChecked=0, Total=2652 [2018-03-23 12:00:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-03-23 12:00:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 227. [2018-03-23 12:00:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-03-23 12:00:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 237 transitions. [2018-03-23 12:00:23,164 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 237 transitions. Word has length 65 [2018-03-23 12:00:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:23,164 INFO L459 AbstractCegarLoop]: Abstraction has 227 states and 237 transitions. [2018-03-23 12:00:23,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-03-23 12:00:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 237 transitions. [2018-03-23 12:00:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-03-23 12:00:23,165 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:23,165 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:23,165 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:23,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1828337242, now seen corresponding path program 2 times [2018-03-23 12:00:23,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:23,165 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:23,166 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:23,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:23,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:23,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:23,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:23,698 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:23,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:00:23,734 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:00:23,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:00:23,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:23,822 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-03-23 12:00:23,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:23,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:23,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:23,870 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-03-23 12:00:23,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:23,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:23,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:23,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:23,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-03-23 12:00:23,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 15 treesize of output 11 [2018-03-23 12:00:23,937 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 7 [2018-03-23 12:00:23,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:23,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:23,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:23,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-03-23 12:00:24,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-03-23 12:00:24,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:24,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,116 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 17 treesize of output 14 [2018-03-23 12:00:24,116 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 12:00:24,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-23 12:00:24,144 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:49 [2018-03-23 12:00:24,241 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:24,241 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:24,242 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 37 treesize of output 41 [2018-03-23 12:00:24,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,274 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:24,275 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:24,276 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 33 treesize of output 37 [2018-03-23 12:00:24,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 12:00:24,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:67 [2018-03-23 12:00:24,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 61 [2018-03-23 12:00:24,425 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 50 treesize of output 44 [2018-03-23 12:00:24,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,504 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:24,504 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 42 treesize of output 38 [2018-03-23 12:00:24,505 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 12:00:24,587 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 42 treesize of output 37 [2018-03-23 12:00:24,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-03-23 12:00:24,591 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-03-23 12:00:24,635 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:94, output treesize:109 [2018-03-23 12:00:24,787 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 41 [2018-03-23 12:00:24,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:24,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,817 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:24,833 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 70 treesize of output 76 [2018-03-23 12:00:24,850 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 53 [2018-03-23 12:00:24,851 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-03-23 12:00:24,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2018-03-23 12:00:24,889 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:24,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 12:00:24,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-03-23 12:00:24,934 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:116, output treesize:70 [2018-03-23 12:00:25,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-03-23 12:00:25,011 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-03-23 12:00:25,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:25,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:25,019 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-03-23 12:00:25,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2018-03-23 12:00:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:25,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:25,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 32 [2018-03-23 12:00:25,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-03-23 12:00:25,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-03-23 12:00:25,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-03-23 12:00:25,116 INFO L87 Difference]: Start difference. First operand 227 states and 237 transitions. Second operand 33 states. [2018-03-23 12:00:25,923 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 55 DAG size of output 35 [2018-03-23 12:00:26,253 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 59 DAG size of output 39 [2018-03-23 12:00:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:27,890 INFO L93 Difference]: Finished difference Result 363 states and 380 transitions. [2018-03-23 12:00:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-03-23 12:00:27,891 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-03-23 12:00:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:27,892 INFO L225 Difference]: With dead ends: 363 [2018-03-23 12:00:27,892 INFO L226 Difference]: Without dead ends: 362 [2018-03-23 12:00:27,893 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=681, Invalid=3101, Unknown=0, NotChecked=0, Total=3782 [2018-03-23 12:00:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-03-23 12:00:27,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 265. [2018-03-23 12:00:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-03-23 12:00:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 278 transitions. [2018-03-23 12:00:27,915 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 278 transitions. Word has length 70 [2018-03-23 12:00:27,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:27,916 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 278 transitions. [2018-03-23 12:00:27,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-03-23 12:00:27,916 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 278 transitions. [2018-03-23 12:00:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-03-23 12:00:27,917 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:27,917 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:27,917 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1828337241, now seen corresponding path program 2 times [2018-03-23 12:00:27,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:27,918 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:27,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:27,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:00:27,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:27,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:28,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:28,503 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:28,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:00:28,538 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:00:28,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:00:28,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:28,726 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:28,727 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:28,727 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-03-23 12:00:28,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:28,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 12:00:28,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:28,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:28,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-03-23 12:00:28,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-23 12:00:28,902 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-03-23 12:00:28,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:28,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:28,920 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-03-23 12:00:28,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:28,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:28,923 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:28,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:28,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:51 [2018-03-23 12:00:29,051 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:29,054 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 45 treesize of output 46 [2018-03-23 12:00:29,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-03-23 12:00:29,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,079 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:29,084 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-03-23 12:00:29,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:29,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:74, output treesize:70 [2018-03-23 12:00:29,197 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:29,198 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:29,198 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:29,199 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 20 treesize of output 21 [2018-03-23 12:00:29,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-03-23 12:00:29,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:73 [2018-03-23 12:00:29,290 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:29,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-03-23 12:00:29,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 12:00:29,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-03-23 12:00:29,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-03-23 12:00:29,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:67 [2018-03-23 12:00:29,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 88 [2018-03-23 12:00:29,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:00:29,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,547 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 35 treesize of output 36 [2018-03-23 12:00:29,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:00:29,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:29,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:123, output treesize:84 [2018-03-23 12:00:29,699 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 81 treesize of output 49 [2018-03-23 12:00:29,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-03-23 12:00:29,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-03-23 12:00:29,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:29,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:29,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-03-23 12:00:29,757 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-03-23 12:00:29,757 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,762 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-03-23 12:00:29,762 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,764 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:29,774 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-03-23 12:00:29,774 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:95, output treesize:18 [2018-03-23 12:00:29,875 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:29,910 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:29,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2018-03-23 12:00:29,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-03-23 12:00:29,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-03-23 12:00:29,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1036, Unknown=1, NotChecked=0, Total=1190 [2018-03-23 12:00:29,911 INFO L87 Difference]: Start difference. First operand 265 states and 278 transitions. Second operand 35 states. [2018-03-23 12:00:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:33,047 INFO L93 Difference]: Finished difference Result 382 states and 398 transitions. [2018-03-23 12:00:33,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-03-23 12:00:33,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2018-03-23 12:00:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:33,049 INFO L225 Difference]: With dead ends: 382 [2018-03-23 12:00:33,050 INFO L226 Difference]: Without dead ends: 380 [2018-03-23 12:00:33,051 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=821, Invalid=3870, Unknown=1, NotChecked=0, Total=4692 [2018-03-23 12:00:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-03-23 12:00:33,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 238. [2018-03-23 12:00:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-03-23 12:00:33,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 249 transitions. [2018-03-23 12:00:33,064 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 249 transitions. Word has length 70 [2018-03-23 12:00:33,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:33,064 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 249 transitions. [2018-03-23 12:00:33,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-03-23 12:00:33,064 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 249 transitions. [2018-03-23 12:00:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-03-23 12:00:33,065 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:33,065 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:33,065 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:33,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1686782202, now seen corresponding path program 1 times [2018-03-23 12:00:33,066 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:33,066 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:33,066 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:33,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:00:33,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:33,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 12:00:33,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:33,374 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:33,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:33,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:33,422 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:33,423 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:33,423 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-03-23 12:00:33,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:33,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:33,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-03-23 12:00:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-03-23 12:00:33,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 12:00:33,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2018-03-23 12:00:33,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-23 12:00:33,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-23 12:00:33,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-03-23 12:00:33,460 INFO L87 Difference]: Start difference. First operand 238 states and 249 transitions. Second operand 11 states. [2018-03-23 12:00:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:33,804 INFO L93 Difference]: Finished difference Result 285 states and 297 transitions. [2018-03-23 12:00:33,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-23 12:00:33,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-03-23 12:00:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:33,805 INFO L225 Difference]: With dead ends: 285 [2018-03-23 12:00:33,805 INFO L226 Difference]: Without dead ends: 278 [2018-03-23 12:00:33,806 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2018-03-23 12:00:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-03-23 12:00:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 243. [2018-03-23 12:00:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-03-23 12:00:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 254 transitions. [2018-03-23 12:00:33,816 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 254 transitions. Word has length 71 [2018-03-23 12:00:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:33,817 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 254 transitions. [2018-03-23 12:00:33,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-23 12:00:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 254 transitions. [2018-03-23 12:00:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-03-23 12:00:33,817 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:33,818 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:33,818 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:33,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1296769769, now seen corresponding path program 1 times [2018-03-23 12:00:33,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:33,818 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:33,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:33,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:33,819 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:33,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:34,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:34,131 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:34,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:34,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:34,232 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:34,232 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:34,233 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-03-23 12:00:34,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-03-23 12:00:34,271 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-03-23 12:00:34,273 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-03-23 12:00:34,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,286 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-03-23 12:00:34,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:34,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,298 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-03-23 12:00:34,390 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:34,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-03-23 12:00:34,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:34,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,447 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:34,450 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 37 treesize of output 42 [2018-03-23 12:00:34,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-03-23 12:00:34,453 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:73 [2018-03-23 12:00:34,518 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:34,519 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:34,520 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:34,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-03-23 12:00:34,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:90 [2018-03-23 12:00:34,592 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:34,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-03-23 12:00:34,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-03-23 12:00:34,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-03-23 12:00:34,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-03-23 12:00:34,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,672 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:88 [2018-03-23 12:00:34,792 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 131 treesize of output 119 [2018-03-23 12:00:34,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-03-23 12:00:34,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 100 [2018-03-23 12:00:34,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:34,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:34,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:34,845 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:153, output treesize:102 [2018-03-23 12:00:35,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 76 [2018-03-23 12:00:35,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-23 12:00:35,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:35,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2018-03-23 12:00:35,162 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:35,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:35,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:35,183 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:116, output treesize:74 [2018-03-23 12:00:35,389 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 70 treesize of output 45 [2018-03-23 12:00:35,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-03-23 12:00:35,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:35,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-03-23 12:00:35,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:35,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:35,414 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-03-23 12:00:35,415 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:75, output treesize:28 [2018-03-23 12:00:35,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:35,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:35,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 38 [2018-03-23 12:00:35,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-03-23 12:00:35,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-03-23 12:00:35,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1309, Unknown=0, NotChecked=0, Total=1482 [2018-03-23 12:00:35,563 INFO L87 Difference]: Start difference. First operand 243 states and 254 transitions. Second operand 39 states. [2018-03-23 12:00:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:39,077 INFO L93 Difference]: Finished difference Result 348 states and 365 transitions. [2018-03-23 12:00:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-03-23 12:00:39,079 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-03-23 12:00:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:39,081 INFO L225 Difference]: With dead ends: 348 [2018-03-23 12:00:39,081 INFO L226 Difference]: Without dead ends: 347 [2018-03-23 12:00:39,082 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=698, Invalid=3994, Unknown=0, NotChecked=0, Total=4692 [2018-03-23 12:00:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-03-23 12:00:39,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 279. [2018-03-23 12:00:39,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-03-23 12:00:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 293 transitions. [2018-03-23 12:00:39,105 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 293 transitions. Word has length 72 [2018-03-23 12:00:39,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:39,106 INFO L459 AbstractCegarLoop]: Abstraction has 279 states and 293 transitions. [2018-03-23 12:00:39,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-03-23 12:00:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 293 transitions. [2018-03-23 12:00:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-03-23 12:00:39,107 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:39,108 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:39,108 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:39,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1296769770, now seen corresponding path program 1 times [2018-03-23 12:00:39,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:39,108 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:39,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:39,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:39,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:39,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:39,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:39,793 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:39,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:39,831 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:39,918 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:39,932 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:39,933 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-03-23 12:00:39,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:39,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:39,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-03-23 12:00:39,998 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-03-23 12:00:40,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 12:00:40,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,013 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-03-23 12:00:40,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 12:00:40,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,016 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-03-23 12:00:40,128 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:40,131 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 26 treesize of output 31 [2018-03-23 12:00:40,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:40,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,155 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:40,159 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 51 treesize of output 52 [2018-03-23 12:00:40,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:40,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:73 [2018-03-23 12:00:40,216 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:40,217 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:40,218 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:40,218 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 20 treesize of output 21 [2018-03-23 12:00:40,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,234 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 6 treesize of output 5 [2018-03-23 12:00:40,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:79 [2018-03-23 12:00:40,286 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:00:40,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2018-03-23 12:00:40,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 37 [2018-03-23 12:00:40,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,314 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:40,317 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 61 treesize of output 60 [2018-03-23 12:00:40,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-03-23 12:00:40,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:98, output treesize:89 [2018-03-23 12:00:40,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 118 [2018-03-23 12:00:40,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:40,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2018-03-23 12:00:40,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:40,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:40,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:154, output treesize:103 [2018-03-23 12:00:40,737 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 126 treesize of output 93 [2018-03-23 12:00:40,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 23 [2018-03-23 12:00:40,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,749 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 39 treesize of output 31 [2018-03-23 12:00:40,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:40,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:40,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-03-23 12:00:40,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-03-23 12:00:40,774 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,781 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-03-23 12:00:40,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-23 12:00:40,785 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,786 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:40,792 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:133, output treesize:9 [2018-03-23 12:00:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:40,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:40,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2018-03-23 12:00:40,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-03-23 12:00:40,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-03-23 12:00:40,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2018-03-23 12:00:40,885 INFO L87 Difference]: Start difference. First operand 279 states and 293 transitions. Second operand 35 states. [2018-03-23 12:00:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:43,109 INFO L93 Difference]: Finished difference Result 356 states and 374 transitions. [2018-03-23 12:00:43,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-03-23 12:00:43,109 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2018-03-23 12:00:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:43,110 INFO L225 Difference]: With dead ends: 356 [2018-03-23 12:00:43,111 INFO L226 Difference]: Without dead ends: 353 [2018-03-23 12:00:43,111 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=453, Invalid=3087, Unknown=0, NotChecked=0, Total=3540 [2018-03-23 12:00:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-03-23 12:00:43,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 281. [2018-03-23 12:00:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-03-23 12:00:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 295 transitions. [2018-03-23 12:00:43,129 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 295 transitions. Word has length 72 [2018-03-23 12:00:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:43,129 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 295 transitions. [2018-03-23 12:00:43,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-03-23 12:00:43,130 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 295 transitions. [2018-03-23 12:00:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-03-23 12:00:43,131 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:43,131 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:43,131 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1899986030, now seen corresponding path program 1 times [2018-03-23 12:00:43,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:43,132 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:43,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:43,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:43,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:43,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:43,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:43,839 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:43,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:43,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:43,922 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:43,922 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:43,923 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-03-23 12:00:43,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:43,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:43,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-03-23 12:00:43,949 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-03-23 12:00:43,951 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-03-23 12:00:43,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:43,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:43,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:43,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-03-23 12:00:44,040 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 28 treesize of output 24 [2018-03-23 12:00:44,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:44,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:44,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:44,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:44,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:8 [2018-03-23 12:00:44,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-03-23 12:00:44,131 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-03-23 12:00:44,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:44,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:44,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:44,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-03-23 12:00:44,181 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:44,181 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-03-23 12:00:44,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:44,187 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-03-23 12:00:44,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-03-23 12:00:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:44,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:44,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 32 [2018-03-23 12:00:44,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-03-23 12:00:44,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-03-23 12:00:44,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-03-23 12:00:44,251 INFO L87 Difference]: Start difference. First operand 281 states and 295 transitions. Second operand 33 states. [2018-03-23 12:00:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:46,438 INFO L93 Difference]: Finished difference Result 391 states and 411 transitions. [2018-03-23 12:00:46,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-03-23 12:00:46,438 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 76 [2018-03-23 12:00:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:46,439 INFO L225 Difference]: With dead ends: 391 [2018-03-23 12:00:46,439 INFO L226 Difference]: Without dead ends: 390 [2018-03-23 12:00:46,441 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1075, Invalid=4625, Unknown=0, NotChecked=0, Total=5700 [2018-03-23 12:00:46,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-03-23 12:00:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 298. [2018-03-23 12:00:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-03-23 12:00:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 315 transitions. [2018-03-23 12:00:46,454 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 315 transitions. Word has length 76 [2018-03-23 12:00:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:46,454 INFO L459 AbstractCegarLoop]: Abstraction has 298 states and 315 transitions. [2018-03-23 12:00:46,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-03-23 12:00:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 315 transitions. [2018-03-23 12:00:46,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-03-23 12:00:46,455 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:46,456 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:46,456 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:46,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1899986029, now seen corresponding path program 1 times [2018-03-23 12:00:46,456 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:46,456 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:46,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:46,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:46,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:46,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:46,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:46,814 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:46,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:46,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:46,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-03-23 12:00:46,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-03-23 12:00:46,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:46,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:46,915 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 26 treesize of output 20 [2018-03-23 12:00:46,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-03-23 12:00:46,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:46,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:46,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:46,921 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-03-23 12:00:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 12:00:46,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:00:46,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 21 [2018-03-23 12:00:46,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-03-23 12:00:46,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-03-23 12:00:46,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-03-23 12:00:46,978 INFO L87 Difference]: Start difference. First operand 298 states and 315 transitions. Second operand 22 states. [2018-03-23 12:00:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:00:48,020 INFO L93 Difference]: Finished difference Result 389 states and 410 transitions. [2018-03-23 12:00:48,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-03-23 12:00:48,020 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-03-23 12:00:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:00:48,021 INFO L225 Difference]: With dead ends: 389 [2018-03-23 12:00:48,021 INFO L226 Difference]: Without dead ends: 387 [2018-03-23 12:00:48,022 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=2216, Unknown=0, NotChecked=0, Total=2550 [2018-03-23 12:00:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-03-23 12:00:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 316. [2018-03-23 12:00:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-03-23 12:00:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 334 transitions. [2018-03-23 12:00:48,035 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 334 transitions. Word has length 76 [2018-03-23 12:00:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:00:48,035 INFO L459 AbstractCegarLoop]: Abstraction has 316 states and 334 transitions. [2018-03-23 12:00:48,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-03-23 12:00:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 334 transitions. [2018-03-23 12:00:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-03-23 12:00:48,036 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:00:48,036 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:00:48,036 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:00:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 34612086, now seen corresponding path program 1 times [2018-03-23 12:00:48,036 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:00:48,036 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:00:48,037 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:48,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:48,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:00:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:48,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:00:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:00:48,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:00:48,590 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:00:48,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:00:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:00:48,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:00:48,725 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:48,726 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:48,727 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-03-23 12:00:48,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-03-23 12:00:48,782 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-03-23 12:00:48,790 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-03-23 12:00:48,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,807 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-03-23 12:00:48,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:48,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-03-23 12:00:48,918 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:48,921 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-03-23 12:00:48,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 12:00:48,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,940 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:48,943 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 47 treesize of output 48 [2018-03-23 12:00:48,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:48,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:48,963 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2018-03-23 12:00:49,016 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:49,017 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:49,018 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:49,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-03-23 12:00:49,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:59 [2018-03-23 12:00:49,073 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:49,076 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 53 treesize of output 52 [2018-03-23 12:00:49,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 12:00:49,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-03-23 12:00:49,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-03-23 12:00:49,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,124 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:54 [2018-03-23 12:00:49,239 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:49,240 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:49,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 72 [2018-03-23 12:00:49,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:00:49,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,277 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:49,280 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 19 treesize of output 28 [2018-03-23 12:00:49,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:00:49,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,300 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-03-23 12:00:49,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:84 [2018-03-23 12:00:49,358 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:49,359 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:49,359 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 21 treesize of output 33 [2018-03-23 12:00:49,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,378 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-03-23 12:00:49,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:98, output treesize:100 [2018-03-23 12:00:49,435 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:00:49,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2018-03-23 12:00:49,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 12:00:49,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,477 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:00:49,479 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 34 treesize of output 49 [2018-03-23 12:00:49,481 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 27 treesize of output 19 [2018-03-23 12:00:49,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:00:49,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:00:49,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:98 [2018-03-23 12:00:49,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 144 treesize of output 144 [2018-03-23 12:00:49,710 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-03-23 12:00:49,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 164 [2018-03-23 12:00:49,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:00,364 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 142 [2018-03-23 12:01:00,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:01,215 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 106 treesize of output 98 [2018-03-23 12:01:01,216 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:02,136 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 102 [2018-03-23 12:01:02,137 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:04,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 11 dim-0 vars, 8 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2018-03-23 12:01:05,509 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 157 treesize of output 136 [2018-03-23 12:01:05,512 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 40 treesize of output 48 [2018-03-23 12:01:05,512 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,530 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,556 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 6 case distinctions, treesize of input 147 treesize of output 170 [2018-03-23 12:01:05,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 159 [2018-03-23 12:01:05,566 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,680 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,683 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:05,685 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 135 treesize of output 151 [2018-03-23 12:01:05,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2018-03-23 12:01:05,688 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,708 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,710 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:05,715 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 97 treesize of output 106 [2018-03-23 12:01:05,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:01:05,717 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,734 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,737 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:05,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 117 [2018-03-23 12:01:05,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2018-03-23 12:01:05,741 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,758 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,760 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:05,766 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 128 treesize of output 141 [2018-03-23 12:01:05,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:01:05,768 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,787 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,790 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:05,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 164 [2018-03-23 12:01:05,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2018-03-23 12:01:05,796 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,814 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,817 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:05,819 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 98 treesize of output 114 [2018-03-23 12:01:05,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2018-03-23 12:01:05,821 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,836 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,838 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:05,841 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 132 treesize of output 148 [2018-03-23 12:01:05,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2018-03-23 12:01:05,843 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:05,861 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:06,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 24 dim-0 vars, and 9 xjuncts. [2018-03-23 12:01:06,073 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 5 variables, input treesize:157, output treesize:1101 [2018-03-23 12:01:06,494 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 263 DAG size of output 121 [2018-03-23 12:01:06,703 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 121 [2018-03-23 12:01:06,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2018-03-23 12:01:06,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-03-23 12:01:06,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:06,784 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-03-23 12:01:06,784 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:06,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:06,872 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 108 treesize of output 86 [2018-03-23 12:01:06,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-03-23 12:01:06,917 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:06,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2018-03-23 12:01:06,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:06,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 12:01:06,960 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:06,973 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:07,056 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 160 treesize of output 148 [2018-03-23 12:01:07,059 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 140 treesize of output 133 [2018-03-23 12:01:07,059 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:07,151 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 129 treesize of output 122 [2018-03-23 12:01:07,151 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:07,231 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 133 treesize of output 126 [2018-03-23 12:01:07,232 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:07,308 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 128 treesize of output 121 [2018-03-23 12:01:07,309 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:07,386 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:07,386 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 121 treesize of output 107 [2018-03-23 12:01:07,387 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:07,494 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 117 treesize of output 103 [2018-03-23 12:01:07,494 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:07,537 INFO L267 ElimStorePlain]: Start of recursive call 9: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:07,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 88 [2018-03-23 12:01:07,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2018-03-23 12:01:07,620 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:07,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2018-03-23 12:01:07,754 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:07,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-03-23 12:01:07,894 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:08,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2018-03-23 12:01:08,022 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:08,147 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 73 treesize of output 69 [2018-03-23 12:01:08,148 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:08,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2018-03-23 12:01:08,277 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:08,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2018-03-23 12:01:08,407 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:08,524 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 53 treesize of output 42 [2018-03-23 12:01:08,524 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:08,647 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 36 treesize of output 32 [2018-03-23 12:01:08,648 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:08,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 61 [2018-03-23 12:01:08,777 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 8 xjuncts. [2018-03-23 12:01:08,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-03-23 12:01:08,954 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:09,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 66 [2018-03-23 12:01:09,122 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-03-23 12:01:09,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-03-23 12:01:09,311 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:09,489 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 58 treesize of output 54 [2018-03-23 12:01:09,489 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:09,491 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 48 treesize of output 44 [2018-03-23 12:01:09,491 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:09,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-03-23 12:01:09,669 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:09,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2018-03-23 12:01:09,846 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:10,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2018-03-23 12:01:10,031 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:10,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2018-03-23 12:01:10,212 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:10,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2018-03-23 12:01:10,401 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:10,591 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 44 treesize of output 33 [2018-03-23 12:01:10,591 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:10,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2018-03-23 12:01:10,595 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:10,785 INFO L267 ElimStorePlain]: Start of recursive call 16: 20 dim-1 vars, End of recursive call: 12 dim-0 vars, and 15 xjuncts. [2018-03-23 12:01:11,047 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 52 [2018-03-23 12:01:11,049 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-03-23 12:01:11,049 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-03-23 12:01:11,061 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 12:01:11,072 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,080 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,323 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 113 treesize of output 111 [2018-03-23 12:01:11,325 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-03-23 12:01:11,325 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,339 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-03-23 12:01:11,339 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,350 INFO L267 ElimStorePlain]: Start of recursive call 43: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,585 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 60 [2018-03-23 12:01:11,586 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-03-23 12:01:11,587 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-03-23 12:01:11,598 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-03-23 12:01:11,606 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,612 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2018-03-23 12:01:11,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-03-23 12:01:11,840 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-03-23 12:01:11,852 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:11,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-03-23 12:01:11,863 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:11,870 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:12,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 8 dim-2 vars, End of recursive call: 16 dim-0 vars, and 16 xjuncts. [2018-03-23 12:01:12,088 INFO L202 ElimStorePlain]: Needed 53 recursive calls to eliminate 22 variables, input treesize:483, output treesize:363 [2018-03-23 12:01:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:01:12,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:01:12,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 48 [2018-03-23 12:01:12,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-03-23 12:01:12,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-03-23 12:01:12,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2059, Unknown=0, NotChecked=0, Total=2352 [2018-03-23 12:01:12,460 INFO L87 Difference]: Start difference. First operand 316 states and 334 transitions. Second operand 49 states. [2018-03-23 12:01:15,252 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 175 DAG size of output 140 [2018-03-23 12:01:15,857 WARN L151 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 156 DAG size of output 134 [2018-03-23 12:01:16,199 WARN L151 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 236 DAG size of output 125 [2018-03-23 12:01:16,726 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 236 DAG size of output 125 [2018-03-23 12:01:17,582 WARN L151 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 250 DAG size of output 135 [2018-03-23 12:01:17,879 WARN L151 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 162 DAG size of output 140 [2018-03-23 12:01:18,559 WARN L151 SmtUtils]: Spent 622ms on a formula simplification. DAG size of input: 148 DAG size of output 130 [2018-03-23 12:01:18,824 WARN L151 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 153 DAG size of output 125 [2018-03-23 12:01:19,376 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 128 DAG size of output 121 [2018-03-23 12:01:19,680 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 139 DAG size of output 123 [2018-03-23 12:01:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:01:20,027 INFO L93 Difference]: Finished difference Result 531 states and 560 transitions. [2018-03-23 12:01:20,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-03-23 12:01:20,027 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 77 [2018-03-23 12:01:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:01:20,029 INFO L225 Difference]: With dead ends: 531 [2018-03-23 12:01:20,029 INFO L226 Difference]: Without dead ends: 530 [2018-03-23 12:01:20,031 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4103 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2430, Invalid=10680, Unknown=0, NotChecked=0, Total=13110 [2018-03-23 12:01:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-03-23 12:01:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 363. [2018-03-23 12:01:20,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-03-23 12:01:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 384 transitions. [2018-03-23 12:01:20,060 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 384 transitions. Word has length 77 [2018-03-23 12:01:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:01:20,060 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 384 transitions. [2018-03-23 12:01:20,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-03-23 12:01:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 384 transitions. [2018-03-23 12:01:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-03-23 12:01:20,062 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:01:20,062 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:01:20,062 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:01:20,062 INFO L82 PathProgramCache]: Analyzing trace with hash 34612087, now seen corresponding path program 1 times [2018-03-23 12:01:20,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:01:20,063 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:01:20,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:01:20,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:01:20,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:01:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:01:20,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:01:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:01:20,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:01:20,763 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:01:20,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:01:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:01:20,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:01:20,926 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:20,926 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:20,927 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-03-23 12:01:20,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:20,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:20,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-03-23 12:01:20,968 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-03-23 12:01:20,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:01:20,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:20,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:20,984 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-03-23 12:01:20,986 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-03-23 12:01:20,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:20,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:20,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:20,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-03-23 12:01:21,104 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,107 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-03-23 12:01:21,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:01:21,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,127 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,129 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 47 treesize of output 48 [2018-03-23 12:01:21,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:01:21,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,150 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-03-23 12:01:21,247 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21 [2018-03-23 12:01:21,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,272 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,272 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,273 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,273 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 20 treesize of output 21 [2018-03-23 12:01:21,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:82, output treesize:78 [2018-03-23 12:01:21,337 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,340 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 64 treesize of output 63 [2018-03-23 12:01:21,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 12:01:21,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-03-23 12:01:21,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-03-23 12:01:21,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:77 [2018-03-23 12:01:21,542 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,543 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 92 [2018-03-23 12:01:21,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:01:21,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,589 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,591 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 19 treesize of output 28 [2018-03-23 12:01:21,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:01:21,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,615 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-03-23 12:01:21,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:119, output treesize:111 [2018-03-23 12:01:21,677 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 54 [2018-03-23 12:01:21,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,705 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,706 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,706 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-03-23 12:01:21,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,726 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-03-23 12:01:21,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:118 [2018-03-23 12:01:21,790 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:21,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 95 [2018-03-23 12:01:21,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 12:01:21,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,837 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:21,839 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 34 treesize of output 49 [2018-03-23 12:01:21,842 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 27 treesize of output 19 [2018-03-23 12:01:21,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:21,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:21,866 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:116 [2018-03-23 12:01:22,082 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 6 case distinctions, treesize of input 69 treesize of output 104 [2018-03-23 12:01:22,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 100 [2018-03-23 12:01:22,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:22,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-03-23 12:01:22,167 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:22,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:22,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 155 treesize of output 149 [2018-03-23 12:01:22,263 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-03-23 12:01:22,283 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-03-23 12:01:22,284 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:22,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 152 treesize of output 151 [2018-03-23 12:01:22,816 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:23,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 153 [2018-03-23 12:01:23,102 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:23,335 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 111 treesize of output 101 [2018-03-23 12:01:23,336 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:23,567 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 94 [2018-03-23 12:01:23,568 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:24,383 INFO L267 ElimStorePlain]: Start of recursive call 5: 6 dim-0 vars, 8 dim-1 vars, End of recursive call: 7 dim-0 vars, and 9 xjuncts. [2018-03-23 12:01:24,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 25 dim-0 vars, and 9 xjuncts. [2018-03-23 12:01:24,602 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:175, output treesize:1237 [2018-03-23 12:01:25,053 WARN L151 SmtUtils]: Spent 202ms on a formula simplification. DAG size of input: 292 DAG size of output 131 [2018-03-23 12:01:25,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 139 [2018-03-23 12:01:25,312 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 120 treesize of output 108 [2018-03-23 12:01:25,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:25,562 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 124 treesize of output 120 [2018-03-23 12:01:25,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:25,800 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 99 treesize of output 95 [2018-03-23 12:01:25,801 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:26,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2018-03-23 12:01:26,038 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:26,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 113 [2018-03-23 12:01:26,294 INFO L267 ElimStorePlain]: Start of recursive call 7: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-03-23 12:01:26,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 106 [2018-03-23 12:01:26,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:26,972 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 118 treesize of output 106 [2018-03-23 12:01:26,973 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:27,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 85 treesize of output 76 [2018-03-23 12:01:27,311 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:27,313 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 78 treesize of output 67 [2018-03-23 12:01:27,314 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:27,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2018-03-23 12:01:27,316 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:27,318 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 80 treesize of output 71 [2018-03-23 12:01:27,319 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:27,669 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 106 treesize of output 105 [2018-03-23 12:01:27,670 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:28,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2018-03-23 12:01:28,034 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:28,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 88 [2018-03-23 12:01:28,041 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:28,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 107 [2018-03-23 12:01:28,408 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:28,751 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 112 treesize of output 101 [2018-03-23 12:01:28,752 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:29,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-03-23 12:01:29,095 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:29,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 93 [2018-03-23 12:01:29,431 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:29,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 86 [2018-03-23 12:01:29,773 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:30,117 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 78 treesize of output 76 [2018-03-23 12:01:30,118 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:30,452 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 102 treesize of output 87 [2018-03-23 12:01:30,452 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:30,786 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:30,788 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:30,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 99 [2018-03-23 12:01:30,793 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:31,150 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 106 treesize of output 83 [2018-03-23 12:01:31,151 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:31,493 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 93 treesize of output 84 [2018-03-23 12:01:31,494 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:31,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 20 dim-1 vars, End of recursive call: 20 dim-0 vars, and 13 xjuncts. [2018-03-23 12:01:32,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 84 [2018-03-23 12:01:32,306 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 80 treesize of output 73 [2018-03-23 12:01:32,307 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,357 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:32,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 62 [2018-03-23 12:01:32,358 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,404 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 73 treesize of output 66 [2018-03-23 12:01:32,405 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-03-23 12:01:32,449 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,489 INFO L267 ElimStorePlain]: Start of recursive call 27: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,500 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 87 treesize of output 89 [2018-03-23 12:01:32,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-03-23 12:01:32,503 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-03-23 12:01:32,594 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2018-03-23 12:01:32,681 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,766 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:32,767 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 70 treesize of output 54 [2018-03-23 12:01:32,767 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2018-03-23 12:01:32,885 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,934 INFO L267 ElimStorePlain]: Start of recursive call 32: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 69 [2018-03-23 12:01:32,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2018-03-23 12:01:32,944 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:32,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-03-23 12:01:32,984 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-03-23 12:01:33,020 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-03-23 12:01:33,057 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,092 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:33,093 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 54 treesize of output 46 [2018-03-23 12:01:33,093 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,116 INFO L267 ElimStorePlain]: Start of recursive call 38: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,127 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 78 treesize of output 80 [2018-03-23 12:01:33,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2018-03-23 12:01:33,130 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,207 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:33,208 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 68 treesize of output 52 [2018-03-23 12:01:33,208 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-03-23 12:01:33,278 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-03-23 12:01:33,353 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2018-03-23 12:01:33,451 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,491 INFO L267 ElimStorePlain]: Start of recursive call 44: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 74 [2018-03-23 12:01:33,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, 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-03-23 12:01:33,497 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-23 12:01:33,516 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,533 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-03-23 12:01:33,533 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,547 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,558 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 2 case distinctions, treesize of input 87 treesize of output 91 [2018-03-23 12:01:33,561 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 83 treesize of output 76 [2018-03-23 12:01:33,562 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,659 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 76 treesize of output 69 [2018-03-23 12:01:33,660 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 72 [2018-03-23 12:01:33,754 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,847 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:33,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2018-03-23 12:01:33,848 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,917 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 70 treesize of output 61 [2018-03-23 12:01:33,917 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:33,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-03-23 12:01:33,978 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,033 INFO L267 ElimStorePlain]: Start of recursive call 54: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,040 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 79 treesize of output 75 [2018-03-23 12:01:34,043 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 71 treesize of output 62 [2018-03-23 12:01:34,043 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-03-23 12:01:34,084 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-03-23 12:01:34,126 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2018-03-23 12:01:34,176 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,213 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 53 treesize of output 46 [2018-03-23 12:01:34,213 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,235 INFO L267 ElimStorePlain]: Start of recursive call 61: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,246 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 76 treesize of output 74 [2018-03-23 12:01:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-03-23 12:01:34,250 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2018-03-23 12:01:34,298 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2018-03-23 12:01:34,341 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,382 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:34,383 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 66 treesize of output 54 [2018-03-23 12:01:34,383 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,422 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 54 treesize of output 47 [2018-03-23 12:01:34,422 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,451 INFO L267 ElimStorePlain]: Start of recursive call 67: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 78 [2018-03-23 12:01:34,461 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 70 treesize of output 63 [2018-03-23 12:01:34,461 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-03-23 12:01:34,509 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,560 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:34,560 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 63 treesize of output 51 [2018-03-23 12:01:34,561 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,610 INFO L267 ElimStorePlain]: Start of recursive call 73: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,617 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 1 case distinctions, treesize of input 67 treesize of output 65 [2018-03-23 12:01:34,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2018-03-23 12:01:34,620 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,656 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 54 treesize of output 47 [2018-03-23 12:01:34,656 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 50 [2018-03-23 12:01:34,690 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-03-23 12:01:34,723 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,755 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:34,756 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 50 treesize of output 38 [2018-03-23 12:01:34,756 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,774 INFO L267 ElimStorePlain]: Start of recursive call 77: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,777 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 76 treesize of output 66 [2018-03-23 12:01:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-03-23 12:01:34,779 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,795 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-03-23 12:01:34,795 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,810 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-03-23 12:01:34,810 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,822 INFO L267 ElimStorePlain]: Start of recursive call 83: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 81 [2018-03-23 12:01:34,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 70 [2018-03-23 12:01:34,832 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,883 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 70 treesize of output 65 [2018-03-23 12:01:34,883 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-03-23 12:01:34,930 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:34,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 58 [2018-03-23 12:01:34,974 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,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 63 treesize of output 54 [2018-03-23 12:01:35,017 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,044 INFO L267 ElimStorePlain]: Start of recursive call 87: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,069 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 80 treesize of output 78 [2018-03-23 12:01:35,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-03-23 12:01:35,072 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,119 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 67 treesize of output 60 [2018-03-23 12:01:35,119 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,166 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 60 treesize of output 55 [2018-03-23 12:01:35,166 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2018-03-23 12:01:35,210 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,254 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:35,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-03-23 12:01:35,255 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,281 INFO L267 ElimStorePlain]: Start of recursive call 93: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 102 [2018-03-23 12:01:35,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-03-23 12:01:35,623 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:35,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-03-23 12:01:35,643 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,658 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-03-23 12:01:35,659 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:35,671 INFO L267 ElimStorePlain]: Start of recursive call 99: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:35,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-03-23 12:01:35,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-03-23 12:01:36,000 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:36,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, 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-03-23 12:01:36,012 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:36,021 INFO L267 ElimStorePlain]: Start of recursive call 103: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:36,334 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 113 treesize of output 91 [2018-03-23 12:01:36,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-03-23 12:01:36,336 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:36,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-03-23 12:01:36,353 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:36,369 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-03-23 12:01:36,369 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:36,383 INFO L267 ElimStorePlain]: Start of recursive call 106: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:36,692 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 67 treesize of output 57 [2018-03-23 12:01:36,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-23 12:01:36,694 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:36,707 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-03-23 12:01:36,707 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:36,718 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-03-23 12:01:36,719 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:36,727 INFO L267 ElimStorePlain]: Start of recursive call 110: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:37,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 88 [2018-03-23 12:01:37,031 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-03-23 12:01:37,031 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:37,050 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 29 treesize of output 21 [2018-03-23 12:01:37,050 INFO L267 ElimStorePlain]: Start of recursive call 116: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:37,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-03-23 12:01:37,068 INFO L267 ElimStorePlain]: Start of recursive call 117: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:37,083 INFO L267 ElimStorePlain]: Start of recursive call 114: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:37,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2018-03-23 12:01:37,389 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-03-23 12:01:37,389 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:37,404 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-03-23 12:01:37,404 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:37,416 INFO L267 ElimStorePlain]: Start of recursive call 118: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:37,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 8 dim-2 vars, End of recursive call: 26 dim-0 vars, and 16 xjuncts. [2018-03-23 12:01:37,701 INFO L202 ElimStorePlain]: Needed 120 recursive calls to eliminate 22 variables, input treesize:556, output treesize:463 [2018-03-23 12:01:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:01:38,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:01:38,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 48 [2018-03-23 12:01:38,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-03-23 12:01:38,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-03-23 12:01:38,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2085, Unknown=1, NotChecked=0, Total=2352 [2018-03-23 12:01:38,119 INFO L87 Difference]: Start difference. First operand 363 states and 384 transitions. Second operand 49 states. [2018-03-23 12:01:41,512 WARN L151 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 158 DAG size of output 157 [2018-03-23 12:01:42,022 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 168 DAG size of output 155 [2018-03-23 12:01:42,423 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 221 DAG size of output 144 [2018-03-23 12:01:42,856 WARN L151 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 247 DAG size of output 146 [2018-03-23 12:01:43,402 WARN L151 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 260 DAG size of output 162 [2018-03-23 12:01:43,762 WARN L151 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 181 DAG size of output 168 [2018-03-23 12:01:44,048 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 168 DAG size of output 152 [2018-03-23 12:01:44,666 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 140 DAG size of output 140 [2018-03-23 12:01:45,215 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 136 DAG size of output 136 [2018-03-23 12:01:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:01:45,324 INFO L93 Difference]: Finished difference Result 538 states and 567 transitions. [2018-03-23 12:01:45,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-03-23 12:01:45,324 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 77 [2018-03-23 12:01:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:01:45,325 INFO L225 Difference]: With dead ends: 538 [2018-03-23 12:01:45,326 INFO L226 Difference]: Without dead ends: 536 [2018-03-23 12:01:45,326 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3077 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1752, Invalid=8958, Unknown=2, NotChecked=0, Total=10712 [2018-03-23 12:01:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-03-23 12:01:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 366. [2018-03-23 12:01:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-03-23 12:01:45,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 386 transitions. [2018-03-23 12:01:45,347 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 386 transitions. Word has length 77 [2018-03-23 12:01:45,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:01:45,347 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 386 transitions. [2018-03-23 12:01:45,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-03-23 12:01:45,347 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 386 transitions. [2018-03-23 12:01:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-03-23 12:01:45,347 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:01:45,348 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:01:45,348 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:01:45,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1317899106, now seen corresponding path program 2 times [2018-03-23 12:01:45,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:01:45,348 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:01:45,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:01:45,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:01:45,349 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:01:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:01:45,365 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:01:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:01:45,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:01:45,951 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:01:45,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:01:45,984 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:01:45,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:01:45,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:01:45,991 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:45,992 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 5 [2018-03-23 12:01:45,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:45,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:45,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:5 [2018-03-23 12:01:46,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-03-23 12:01:46,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-03-23 12:01:46,039 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,039 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,040 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-03-23 12:01:46,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-03-23 12:01:46,050 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-03-23 12:01:46,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-23 12:01:46,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2018-03-23 12:01:46,082 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-03-23 12:01:46,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 12:01:46,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-03-23 12:01:46,118 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,119 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,119 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 17 treesize of output 21 [2018-03-23 12:01:46,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2018-03-23 12:01:46,160 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 26 treesize of output 25 [2018-03-23 12:01:46,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 12:01:46,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:42 [2018-03-23 12:01:46,271 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,283 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 65 treesize of output 72 [2018-03-23 12:01:46,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 52 [2018-03-23 12:01:46,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-03-23 12:01:46,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-03-23 12:01:46,328 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 12:01:46,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:46,366 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:73, output treesize:106 [2018-03-23 12:01:46,421 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,422 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,423 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,424 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 112 [2018-03-23 12:01:46,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,456 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,457 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,457 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,458 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,458 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 47 treesize of output 67 [2018-03-23 12:01:46,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:46,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:128, output treesize:152 [2018-03-23 12:01:46,560 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 108 [2018-03-23 12:01:46,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-03-23 12:01:46,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,654 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 3 case distinctions, treesize of input 64 treesize of output 68 [2018-03-23 12:01:46,655 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-03-23 12:01:46,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-03-23 12:01:46,761 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:46,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-03-23 12:01:46,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 12:01:46,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:46,821 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 3 xjuncts. [2018-03-23 12:01:46,821 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:174, output treesize:223 [2018-03-23 12:01:47,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 77 [2018-03-23 12:01:47,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:01:47,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:47,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:47,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 113 [2018-03-23 12:01:47,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:01:47,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:47,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:47,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:47,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:258, output treesize:196 [2018-03-23 12:01:47,258 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 66 treesize of output 40 [2018-03-23 12:01:47,259 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 22 treesize of output 16 [2018-03-23 12:01:47,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:47,266 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 25 treesize of output 14 [2018-03-23 12:01:47,267 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:47,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:47,278 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-03-23 12:01:47,278 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:28 [2018-03-23 12:01:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:01:47,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:01:47,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 39 [2018-03-23 12:01:47,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-03-23 12:01:47,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-03-23 12:01:47,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1350, Unknown=7, NotChecked=0, Total=1560 [2018-03-23 12:01:47,401 INFO L87 Difference]: Start difference. First operand 366 states and 386 transitions. Second operand 40 states. [2018-03-23 12:01:49,078 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 92 DAG size of output 76 [2018-03-23 12:01:49,967 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 90 DAG size of output 86 [2018-03-23 12:01:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:01:53,350 INFO L93 Difference]: Finished difference Result 660 states and 699 transitions. [2018-03-23 12:01:53,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-03-23 12:01:53,351 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2018-03-23 12:01:53,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:01:53,353 INFO L225 Difference]: With dead ends: 660 [2018-03-23 12:01:53,353 INFO L226 Difference]: Without dead ends: 659 [2018-03-23 12:01:53,353 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3803 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2124, Invalid=9191, Unknown=27, NotChecked=0, Total=11342 [2018-03-23 12:01:53,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-03-23 12:01:53,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 427. [2018-03-23 12:01:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-03-23 12:01:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 452 transitions. [2018-03-23 12:01:53,385 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 452 transitions. Word has length 77 [2018-03-23 12:01:53,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:01:53,385 INFO L459 AbstractCegarLoop]: Abstraction has 427 states and 452 transitions. [2018-03-23 12:01:53,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-03-23 12:01:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 452 transitions. [2018-03-23 12:01:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-03-23 12:01:53,386 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:01:53,386 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:01:53,386 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:01:53,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1317899105, now seen corresponding path program 2 times [2018-03-23 12:01:53,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:01:53,387 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:01:53,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:01:53,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:01:53,388 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:01:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:01:53,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:01:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:01:54,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:01:54,420 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:01:54,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:01:54,470 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:01:54,470 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:01:54,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:01:54,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:01:54,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,512 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,513 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-03-23 12:01:54,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-03-23 12:01:54,557 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-03-23 12:01:54,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:01:54,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,574 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-03-23 12:01:54,576 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-03-23 12:01:54,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,589 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:51 [2018-03-23 12:01:54,686 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,689 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 45 treesize of output 46 [2018-03-23 12:01:54,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:01:54,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,713 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,716 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-03-23 12:01:54,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-23 12:01:54,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:73 [2018-03-23 12:01:54,822 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-03-23 12:01:54,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,847 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,848 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,849 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-03-23 12:01:54,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:106 [2018-03-23 12:01:54,930 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,933 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 90 [2018-03-23 12:01:54,936 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 23 treesize of output 16 [2018-03-23 12:01:54,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,974 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:54,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2018-03-23 12:01:54,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-03-23 12:01:54,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:54,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:128, output treesize:96 [2018-03-23 12:01:55,157 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,158 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,159 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,162 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 118 [2018-03-23 12:01:55,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-23 12:01:55,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,208 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,211 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 19 treesize of output 28 [2018-03-23 12:01:55,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-03-23 12:01:55,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,240 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-03-23 12:01:55,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:138, output treesize:130 [2018-03-23 12:01:55,312 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,313 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,314 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 40 treesize of output 75 [2018-03-23 12:01:55,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,349 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,350 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,351 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,352 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,352 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-03-23 12:01:55,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,387 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-03-23 12:01:55,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:144, output treesize:135 [2018-03-23 12:01:55,455 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,456 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,460 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 120 [2018-03-23 12:01:55,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-03-23 12:01:55,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,517 INFO L682 Elim1Store]: detected equality via solver [2018-03-23 12:01:55,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-03-23 12:01:55,522 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 27 treesize of output 19 [2018-03-23 12:01:55,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:55,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:154, output treesize:141 [2018-03-23 12:01:55,732 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,739 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 182 [2018-03-23 12:01:55,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-03-23 12:01:55,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 138 [2018-03-23 12:01:55,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-03-23 12:01:55,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:55,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:55,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:261, output treesize:198 [2018-03-23 12:01:55,955 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,957 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:01:55,958 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 111 [2018-03-23 12:01:55,965 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-03-23 12:01:55,966 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:55,998 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 1 case distinctions, treesize of input 83 treesize of output 74 [2018-03-23 12:01:55,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-03-23 12:01:56,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 62 [2018-03-23 12:01:56,001 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:56,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-03-23 12:01:56,044 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:56,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-03-23 12:01:56,046 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:01:56,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:56,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 69 [2018-03-23 12:01:56,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-03-23 12:01:56,122 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:56,140 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-03-23 12:01:56,141 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:56,154 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-03-23 12:01:56,155 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:56,166 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:56,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 69 [2018-03-23 12:01:56,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-03-23 12:01:56,172 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:56,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-03-23 12:01:56,188 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:56,202 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-03-23 12:01:56,202 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-03-23 12:01:56,213 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:01:56,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-03-23 12:01:56,252 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:209, output treesize:73 [2018-03-23 12:01:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:01:56,427 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:01:56,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 43 [2018-03-23 12:01:56,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-03-23 12:01:56,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-03-23 12:01:56,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-03-23 12:01:56,428 INFO L87 Difference]: Start difference. First operand 427 states and 452 transitions. Second operand 44 states. [2018-03-23 12:02:01,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:02:01,347 INFO L93 Difference]: Finished difference Result 605 states and 638 transitions. [2018-03-23 12:02:01,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-03-23 12:02:01,347 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 77 [2018-03-23 12:02:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:02:01,349 INFO L225 Difference]: With dead ends: 605 [2018-03-23 12:02:01,349 INFO L226 Difference]: Without dead ends: 603 [2018-03-23 12:02:01,350 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1580, Invalid=7926, Unknown=0, NotChecked=0, Total=9506 [2018-03-23 12:02:01,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-03-23 12:02:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 380. [2018-03-23 12:02:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-03-23 12:02:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 402 transitions. [2018-03-23 12:02:01,372 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 402 transitions. Word has length 77 [2018-03-23 12:02:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:02:01,372 INFO L459 AbstractCegarLoop]: Abstraction has 380 states and 402 transitions. [2018-03-23 12:02:01,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-03-23 12:02:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 402 transitions. [2018-03-23 12:02:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-23 12:02:01,373 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:02:01,373 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:02:01,373 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:02:01,373 INFO L82 PathProgramCache]: Analyzing trace with hash -909444222, now seen corresponding path program 1 times [2018-03-23 12:02:01,373 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:02:01,373 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:02:01,374 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:02:01,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:02:01,374 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:02:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:02:01,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:02:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:02:01,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:02:01,556 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:02:01,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:02:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:02:01,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:02:01,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-03-23 12:02:01,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-03-23 12:02:01,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:01,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:01,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-03-23 12:02:01,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-03-23 12:02:01,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:01,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:01,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:01,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2018-03-23 12:02:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 12:02:01,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:02:01,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 21 [2018-03-23 12:02:01,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-23 12:02:01,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-23 12:02:01,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-03-23 12:02:01,744 INFO L87 Difference]: Start difference. First operand 380 states and 402 transitions. Second operand 21 states. [2018-03-23 12:02:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:02:02,941 INFO L93 Difference]: Finished difference Result 477 states and 502 transitions. [2018-03-23 12:02:02,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-03-23 12:02:02,942 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2018-03-23 12:02:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:02:02,943 INFO L225 Difference]: With dead ends: 477 [2018-03-23 12:02:02,943 INFO L226 Difference]: Without dead ends: 424 [2018-03-23 12:02:02,944 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=448, Invalid=2102, Unknown=0, NotChecked=0, Total=2550 [2018-03-23 12:02:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-03-23 12:02:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 368. [2018-03-23 12:02:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-03-23 12:02:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 386 transitions. [2018-03-23 12:02:02,970 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 386 transitions. Word has length 79 [2018-03-23 12:02:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:02:02,971 INFO L459 AbstractCegarLoop]: Abstraction has 368 states and 386 transitions. [2018-03-23 12:02:02,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-23 12:02:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 386 transitions. [2018-03-23 12:02:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-23 12:02:02,971 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:02:02,971 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:02:02,972 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:02:02,972 INFO L82 PathProgramCache]: Analyzing trace with hash 865990925, now seen corresponding path program 2 times [2018-03-23 12:02:02,972 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:02:02,972 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:02:02,972 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:02:02,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:02:02,973 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:02:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:02:02,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:02:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:02:03,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:02:03,420 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-03-23 12:02:03,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 12:02:03,452 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 12:02:03,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 12:02:03,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:02:03,557 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:03,557 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:03,558 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-03-23 12:02:03,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-03-23 12:02:03,598 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-03-23 12:02:03,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:02:03,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,620 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-03-23 12:02:03,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, 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-03-23 12:02:03,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,633 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-03-23 12:02:03,733 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:03,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-03-23 12:02:03,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-23 12:02:03,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,757 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:03,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2018-03-23 12:02:03,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 12 treesize of output 15 [2018-03-23 12:02:03,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:76 [2018-03-23 12:02:03,822 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:03,823 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:03,823 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:03,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-03-23 12:02:03,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:87, output treesize:93 [2018-03-23 12:02:03,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2018-03-23 12:02:03,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-03-23 12:02:03,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,926 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:03,928 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:03,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 78 [2018-03-23 12:02:03,931 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 27 treesize of output 27 [2018-03-23 12:02:03,932 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:03,956 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:83 [2018-03-23 12:02:04,086 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:04,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 151 [2018-03-23 12:02:04,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-03-23 12:02:04,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:04,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:04,119 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:04,123 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:04,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 132 [2018-03-23 12:02:04,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-03-23 12:02:04,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:04,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:04,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:04,151 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:175, output treesize:143 [2018-03-23 12:02:04,359 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:04,359 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:04,361 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 116 [2018-03-23 12:02:04,367 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 51 [2018-03-23 12:02:04,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-03-23 12:02:04,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-03-23 12:02:04,384 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:04,393 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 50 treesize of output 40 [2018-03-23 12:02:04,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:02:04,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 12:02:04,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-03-23 12:02:04,417 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-03-23 12:02:04,417 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:04,422 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-03-23 12:02:04,423 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:04,424 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-03-23 12:02:04,425 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:04,425 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:04,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-03-23 12:02:04,432 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:170, output treesize:31 [2018-03-23 12:02:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:02:04,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 12:02:04,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 41 [2018-03-23 12:02:04,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-03-23 12:02:04,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-03-23 12:02:04,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1516, Unknown=0, NotChecked=0, Total=1722 [2018-03-23 12:02:04,644 INFO L87 Difference]: Start difference. First operand 368 states and 386 transitions. Second operand 42 states. [2018-03-23 12:02:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 12:02:07,271 INFO L93 Difference]: Finished difference Result 443 states and 462 transitions. [2018-03-23 12:02:07,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-03-23 12:02:07,272 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 79 [2018-03-23 12:02:07,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 12:02:07,273 INFO L225 Difference]: With dead ends: 443 [2018-03-23 12:02:07,273 INFO L226 Difference]: Without dead ends: 442 [2018-03-23 12:02:07,274 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=941, Invalid=4759, Unknown=0, NotChecked=0, Total=5700 [2018-03-23 12:02:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-03-23 12:02:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 369. [2018-03-23 12:02:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-03-23 12:02:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 388 transitions. [2018-03-23 12:02:07,296 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 388 transitions. Word has length 79 [2018-03-23 12:02:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 12:02:07,296 INFO L459 AbstractCegarLoop]: Abstraction has 369 states and 388 transitions. [2018-03-23 12:02:07,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-03-23 12:02:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 388 transitions. [2018-03-23 12:02:07,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-23 12:02:07,296 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 12:02:07,297 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 12:02:07,297 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr49AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr51AssertViolationMEMORY_FREE, mainErr48AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr52EnsuresViolationMEMORY_LEAK, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr50AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation]=== [2018-03-23 12:02:07,297 INFO L82 PathProgramCache]: Analyzing trace with hash 865990926, now seen corresponding path program 1 times [2018-03-23 12:02:07,297 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 12:02:07,297 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 12:02:07,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:02:07,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 12:02:07,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 12:02:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:02:07,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 12:02:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 12:02:07,807 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 12:02:07,807 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 12:02:07,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 12:02:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 12:02:07,839 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 12:02:07,922 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:07,923 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:07,923 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-03-23 12:02:07,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:07,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:07,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-03-23 12:02:07,961 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-03-23 12:02:07,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:02:07,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:07,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:07,976 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-03-23 12:02:07,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-23 12:02:07,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:07,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:07,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:07,989 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-03-23 12:02:08,089 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:08,093 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 26 treesize of output 31 [2018-03-23 12:02:08,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:02:08,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:08,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:08,121 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 12:02:08,125 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 51 treesize of output 52 [2018-03-23 12:02:08,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-23 12:02:08,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-03-23 12:02:08,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:08,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-23 12:02:08,151 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:73 Received shutdown request... [2018-03-23 12:02:08,174 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-23 12:02:08,174 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-23 12:02:08,182 WARN L197 ceAbstractionStarter]: Timeout [2018-03-23 12:02:08,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 12:02:08 BoogieIcfgContainer [2018-03-23 12:02:08,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-23 12:02:08,183 INFO L168 Benchmark]: Toolchain (without parser) took 124491.90 ms. Allocated memory was 309.3 MB in the beginning and 643.8 MB in the end (delta: 334.5 MB). Free memory was 244.5 MB in the beginning and 326.0 MB in the end (delta: -81.5 MB). Peak memory consumption was 253.0 MB. Max. memory is 5.3 GB. [2018-03-23 12:02:08,184 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 309.3 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-23 12:02:08,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 348.31 ms. Allocated memory is still 309.3 MB. Free memory was 244.5 MB in the beginning and 216.4 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. [2018-03-23 12:02:08,185 INFO L168 Benchmark]: Boogie Preprocessor took 59.50 ms. Allocated memory is still 309.3 MB. Free memory was 216.4 MB in the beginning and 213.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-03-23 12:02:08,185 INFO L168 Benchmark]: RCFGBuilder took 760.62 ms. Allocated memory was 309.3 MB in the beginning and 475.5 MB in the end (delta: 166.2 MB). Free memory was 213.4 MB in the beginning and 394.3 MB in the end (delta: -180.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. [2018-03-23 12:02:08,185 INFO L168 Benchmark]: TraceAbstraction took 123319.20 ms. Allocated memory was 475.5 MB in the beginning and 643.8 MB in the end (delta: 168.3 MB). Free memory was 394.3 MB in the beginning and 326.0 MB in the end (delta: 68.4 MB). Peak memory consumption was 236.7 MB. Max. memory is 5.3 GB. [2018-03-23 12:02:08,186 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.13 ms. Allocated memory is still 309.3 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 348.31 ms. Allocated memory is still 309.3 MB. Free memory was 244.5 MB in the beginning and 216.4 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 59.50 ms. Allocated memory is still 309.3 MB. Free memory was 216.4 MB in the beginning and 213.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 760.62 ms. Allocated memory was 309.3 MB in the beginning and 475.5 MB in the end (delta: 166.2 MB). Free memory was 213.4 MB in the beginning and 394.3 MB in the end (delta: -180.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 123319.20 ms. Allocated memory was 475.5 MB in the beginning and 643.8 MB in the end (delta: 168.3 MB). Free memory was 394.3 MB in the beginning and 326.0 MB in the end (delta: 68.4 MB). Peak memory consumption was 236.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1009]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 999). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1010]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1010). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1048). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1063). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1058]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1058). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1035). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1020]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 992]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 992). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1050]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1022). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 996). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1051]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1051). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1019]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1019). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 995]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1020]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1063). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1057]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1057). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 1014]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1014). Cancelled while BasicCegarLoop was analyzing trace of length 80 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 161 locations, 53 error locations. TIMEOUT Result, 123.2s OverallTime, 32 OverallIterations, 3 TraceHistogramMax, 55.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3524 SDtfs, 22545 SDslu, 32689 SDs, 0 SdLazy, 31588 SolverSat, 2966 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 21.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2383 GetRequests, 1086 SyntacticMatches, 52 SemanticMatches, 1245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23804 ImplicationChecksByTransitivity, 47.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=28, 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.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 2602 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 63.7s InterpolantComputationTime, 2918 NumberOfCodeBlocks, 2918 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 2868 ConstructedInterpolants, 375 QuantifiedInterpolants, 6454422 SizeOfPredicates, 397 NumberOfNonLiveVariables, 4343 ConjunctsInSsa, 857 ConjunctsInUnsatCore, 50 InterpolantComputations, 14 PerfectInterpolantSequences, 23/382 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-23_12-02-08-196.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-23_12-02-08-196.csv Completed graceful shutdown