java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 17:26:12,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 17:26:12,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 17:26:12,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 17:26:12,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 17:26:12,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 17:26:12,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 17:26:12,729 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 17:26:12,731 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 17:26:12,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 17:26:12,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 17:26:12,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 17:26:12,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 17:26:12,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 17:26:12,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 17:26:12,736 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 17:26:12,737 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 17:26:12,739 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 17:26:12,740 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 17:26:12,741 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 17:26:12,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 17:26:12,742 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 17:26:12,743 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 17:26:12,743 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 17:26:12,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 17:26:12,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 17:26:12,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 17:26:12,746 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 17:26:12,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 17:26:12,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 17:26:12,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 17:26:12,747 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 17:26:12,767 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 17:26:12,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 17:26:12,768 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 17:26:12,768 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 17:26:12,768 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 17:26:12,768 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 17:26:12,769 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 17:26:12,769 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 17:26:12,769 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 17:26:12,769 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 17:26:12,769 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 17:26:12,769 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 17:26:12,769 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 17:26:12,769 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 17:26:12,769 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 17:26:12,769 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 17:26:12,769 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 17:26:12,770 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 17:26:12,770 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 17:26:12,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:26:12,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 17:26:12,770 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 17:26:12,770 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 17:26:12,770 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 17:26:12,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 17:26:12,809 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 17:26:12,812 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 17:26:12,813 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 17:26:12,813 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 17:26:12,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,093 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb2f16a41a [2018-04-11 17:26:13,253 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 17:26:13,253 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 17:26:13,253 INFO L168 CDTParser]: Scanning alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,261 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 17:26:13,261 INFO L215 ultiparseSymbolTable]: [2018-04-11 17:26:13,261 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 17:26:13,261 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,261 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__exit ('exit') in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,261 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 17:26:13,261 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__lldiv_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____id_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__fd_set in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____qaddr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____blksize_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__blksize_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____uint32_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__time_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____caddr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,262 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__List in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_key_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__int16_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__uid_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____dev_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__blkcnt_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__mode_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__sigset_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____u_short in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,263 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__ulong in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__div_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____u_long in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____int16_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__caddr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____uint16_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__daddr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____fsid_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__clock_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,264 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__ino_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__ldiv_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pid_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__u_long in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__suseconds_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____int8_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____loff_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____swblk_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__fsid_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__register_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__int64_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,265 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____clock_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____time_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____WAIT_STATUS in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____key_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__ushort in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____uint8_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__u_quad_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____daddr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__loff_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____rlim64_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__int8_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__u_int64_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__wchar_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__uint in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____fd_mask in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,266 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__nlink_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____useconds_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____int64_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__dev_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____u_int in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__u_int8_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__clockid_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____clockid_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____blkcnt_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__quad_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__u_int16_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__fd_mask in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____uint64_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,267 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__ssize_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_once_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____ino_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__u_short in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____uid_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__gid_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__id_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____ino64_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____sigset_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____socklen_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,268 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____quad_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____mode_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__int32_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____gid_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____intptr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____off_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____u_quad_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__size_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__off_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,269 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____nlink_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__u_char in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__key_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____ssize_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__timer_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____rlim_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__u_int in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__u_int32_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____pthread_list_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____int32_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____pid_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,270 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____timer_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,271 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,271 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____off64_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,271 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____suseconds_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,271 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____u_char in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,271 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,283 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb2f16a41a [2018-04-11 17:26:13,287 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 17:26:13,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 17:26:13,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 17:26:13,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 17:26:13,293 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 17:26:13,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:26:13" (1/1) ... [2018-04-11 17:26:13,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566109ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13, skipping insertion in model container [2018-04-11 17:26:13,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:26:13" (1/1) ... [2018-04-11 17:26:13,305 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:26:13,327 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:26:13,451 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:26:13,483 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:26:13,489 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-11 17:26:13,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13 WrapperNode [2018-04-11 17:26:13,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 17:26:13,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 17:26:13,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 17:26:13,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 17:26:13,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13" (1/1) ... [2018-04-11 17:26:13,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13" (1/1) ... [2018-04-11 17:26:13,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13" (1/1) ... [2018-04-11 17:26:13,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13" (1/1) ... [2018-04-11 17:26:13,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13" (1/1) ... [2018-04-11 17:26:13,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13" (1/1) ... [2018-04-11 17:26:13,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13" (1/1) ... [2018-04-11 17:26:13,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 17:26:13,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 17:26:13,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 17:26:13,571 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 17:26:13,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:26:13,659 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 17:26:13,659 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 17:26:13,659 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__exit [2018-04-11 17:26:13,659 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 17:26:13,659 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 17:26:13,659 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 17:26:13,660 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 17:26:13,661 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 17:26:13,661 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 17:26:13,661 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 17:26:13,661 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 17:26:13,661 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 17:26:13,661 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 17:26:13,661 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 17:26:13,661 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 17:26:13,661 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 17:26:13,662 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 17:26:13,662 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 17:26:13,662 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 17:26:13,662 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 17:26:13,662 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 17:26:13,662 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 17:26:13,662 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 17:26:13,662 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 17:26:13,663 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 17:26:13,663 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 17:26:13,663 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 17:26:13,663 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 17:26:13,663 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 17:26:13,663 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 17:26:13,663 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 17:26:13,663 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 17:26:13,663 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 17:26:13,664 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 17:26:13,664 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 17:26:13,664 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 17:26:13,664 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 17:26:13,664 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 17:26:13,664 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 17:26:13,664 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 17:26:13,664 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 17:26:13,664 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 17:26:13,664 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 17:26:13,665 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 17:26:13,665 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 17:26:13,665 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 17:26:13,665 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 17:26:13,665 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 17:26:13,665 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 17:26:13,665 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 17:26:13,665 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 17:26:13,665 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 17:26:13,666 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 17:26:13,666 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 17:26:13,666 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 17:26:13,666 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 17:26:13,666 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_falternating_list_true_unreach_call_true_valid_memsafety_i__exit [2018-04-11 17:26:13,666 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 17:26:13,666 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 17:26:13,666 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 17:26:13,666 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 17:26:13,666 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 17:26:13,667 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 17:26:13,667 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 17:26:13,667 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 17:26:13,667 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 17:26:13,667 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 17:26:13,667 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 17:26:13,667 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 17:26:13,667 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 17:26:13,667 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 17:26:13,667 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 17:26:13,668 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 17:26:13,668 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 17:26:13,668 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 17:26:13,668 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 17:26:13,668 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 17:26:13,668 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 17:26:13,668 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 17:26:13,668 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 17:26:13,669 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 17:26:13,669 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 17:26:13,669 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 17:26:13,669 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 17:26:13,669 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 17:26:13,669 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 17:26:13,669 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 17:26:13,669 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 17:26:13,669 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 17:26:13,670 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 17:26:13,670 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 17:26:13,670 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 17:26:13,670 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 17:26:13,670 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 17:26:13,670 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 17:26:13,670 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 17:26:13,671 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 17:26:13,672 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 17:26:13,672 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 17:26:13,672 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 17:26:13,672 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 17:26:13,672 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 17:26:13,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 17:26:13,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 17:26:13,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 17:26:13,673 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 17:26:13,981 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 17:26:13,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:26:13 BoogieIcfgContainer [2018-04-11 17:26:13,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 17:26:13,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 17:26:13,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 17:26:13,983 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 17:26:13,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 05:26:13" (1/3) ... [2018-04-11 17:26:13,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68659c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:26:13, skipping insertion in model container [2018-04-11 17:26:13,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:26:13" (2/3) ... [2018-04-11 17:26:13,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68659c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:26:13, skipping insertion in model container [2018-04-11 17:26:13,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:26:13" (3/3) ... [2018-04-11 17:26:13,985 INFO L107 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i [2018-04-11 17:26:13,990 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 17:26:13,997 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 27 error locations. [2018-04-11 17:26:14,020 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 17:26:14,021 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 17:26:14,021 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 17:26:14,021 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 17:26:14,021 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 17:26:14,021 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 17:26:14,021 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 17:26:14,021 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 17:26:14,021 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 17:26:14,022 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 17:26:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2018-04-11 17:26:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-11 17:26:14,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:14,039 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:14,039 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash -230402030, now seen corresponding path program 1 times [2018-04-11 17:26:14,042 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:14,042 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:14,070 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:14,070 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:14,102 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:14,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:14,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 17:26:14,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 17:26:14,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 17:26:14,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 17:26:14,136 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2018-04-11 17:26:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:14,152 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-11 17:26:14,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 17:26:14,154 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-04-11 17:26:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:14,160 INFO L225 Difference]: With dead ends: 85 [2018-04-11 17:26:14,160 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 17:26:14,162 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 17:26:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 17:26:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-04-11 17:26:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-11 17:26:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-04-11 17:26:14,188 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 12 [2018-04-11 17:26:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:14,189 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-04-11 17:26:14,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 17:26:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-04-11 17:26:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 17:26:14,189 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:14,189 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:14,189 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1920748982, now seen corresponding path program 1 times [2018-04-11 17:26:14,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:14,190 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:14,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:14,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:14,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:14,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:14,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:26:14,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:26:14,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:26:14,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:26:14,244 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 5 states. [2018-04-11 17:26:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:14,387 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-04-11 17:26:14,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:26:14,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 17:26:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:14,388 INFO L225 Difference]: With dead ends: 99 [2018-04-11 17:26:14,388 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 17:26:14,389 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:26:14,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 17:26:14,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2018-04-11 17:26:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-11 17:26:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2018-04-11 17:26:14,395 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 14 [2018-04-11 17:26:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:14,395 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2018-04-11 17:26:14,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:26:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2018-04-11 17:26:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 17:26:14,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:14,395 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:14,395 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:14,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1920748983, now seen corresponding path program 1 times [2018-04-11 17:26:14,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:14,396 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:14,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:14,396 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:14,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:14,458 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:14,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:26:14,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:26:14,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:26:14,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:26:14,459 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand 5 states. [2018-04-11 17:26:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:14,582 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2018-04-11 17:26:14,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:26:14,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 17:26:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:14,583 INFO L225 Difference]: With dead ends: 108 [2018-04-11 17:26:14,583 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 17:26:14,584 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:26:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 17:26:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2018-04-11 17:26:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 17:26:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-04-11 17:26:14,590 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 14 [2018-04-11 17:26:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:14,590 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-04-11 17:26:14,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:26:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-04-11 17:26:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 17:26:14,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:14,591 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:14,591 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1306042637, now seen corresponding path program 1 times [2018-04-11 17:26:14,592 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:14,592 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:14,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:14,593 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:14,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:14,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:14,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:26:14,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:26:14,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:26:14,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:26:14,646 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 6 states. [2018-04-11 17:26:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:14,727 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2018-04-11 17:26:14,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:26:14,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 17:26:14,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:14,728 INFO L225 Difference]: With dead ends: 109 [2018-04-11 17:26:14,728 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 17:26:14,728 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-04-11 17:26:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 17:26:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2018-04-11 17:26:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 17:26:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2018-04-11 17:26:14,733 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 25 [2018-04-11 17:26:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:14,734 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2018-04-11 17:26:14,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:26:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2018-04-11 17:26:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 17:26:14,735 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:14,735 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:14,735 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:14,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2001951875, now seen corresponding path program 1 times [2018-04-11 17:26:14,735 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:14,736 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:14,736 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:14,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:14,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:14,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:14,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:26:14,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 17:26:14,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 17:26:14,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:26:14,767 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand 3 states. [2018-04-11 17:26:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:14,775 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-04-11 17:26:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 17:26:14,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-04-11 17:26:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:14,784 INFO L225 Difference]: With dead ends: 153 [2018-04-11 17:26:14,784 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 17:26:14,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:26:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 17:26:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 112. [2018-04-11 17:26:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 17:26:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-04-11 17:26:14,790 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 25 [2018-04-11 17:26:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:14,790 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-04-11 17:26:14,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 17:26:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-04-11 17:26:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 17:26:14,791 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:14,791 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:14,791 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1421322937, now seen corresponding path program 1 times [2018-04-11 17:26:14,792 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:14,792 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:14,792 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:14,793 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:14,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:14,835 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:14,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 17:26:14,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:26:14,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:26:14,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:26:14,836 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 6 states. [2018-04-11 17:26:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:14,953 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2018-04-11 17:26:14,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:26:14,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 17:26:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:14,954 INFO L225 Difference]: With dead ends: 157 [2018-04-11 17:26:14,954 INFO L226 Difference]: Without dead ends: 157 [2018-04-11 17:26:14,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:26:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-11 17:26:14,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2018-04-11 17:26:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 17:26:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2018-04-11 17:26:14,959 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 25 [2018-04-11 17:26:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:14,959 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2018-04-11 17:26:14,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:26:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2018-04-11 17:26:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 17:26:14,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:14,960 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:14,960 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1832616237, now seen corresponding path program 1 times [2018-04-11 17:26:14,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:14,960 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:14,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:14,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:14,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:15,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:15,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:26:15,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:26:15,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:26:15,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:26:15,001 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand 6 states. [2018-04-11 17:26:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:15,110 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-04-11 17:26:15,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 17:26:15,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 17:26:15,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:15,111 INFO L225 Difference]: With dead ends: 125 [2018-04-11 17:26:15,111 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 17:26:15,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:26:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 17:26:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2018-04-11 17:26:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 17:26:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-04-11 17:26:15,115 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 26 [2018-04-11 17:26:15,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:15,115 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-04-11 17:26:15,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:26:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-04-11 17:26:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 17:26:15,116 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:15,116 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:15,116 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:15,117 INFO L82 PathProgramCache]: Analyzing trace with hash -219298716, now seen corresponding path program 1 times [2018-04-11 17:26:15,117 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:15,117 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:15,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:15,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:15,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:15,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:15,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:15,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 17:26:15,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 17:26:15,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 17:26:15,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:26:15,157 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 7 states. [2018-04-11 17:26:15,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:15,287 INFO L93 Difference]: Finished difference Result 124 states and 139 transitions. [2018-04-11 17:26:15,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 17:26:15,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-04-11 17:26:15,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:15,288 INFO L225 Difference]: With dead ends: 124 [2018-04-11 17:26:15,288 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 17:26:15,288 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-11 17:26:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 17:26:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2018-04-11 17:26:15,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-11 17:26:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-04-11 17:26:15,292 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 26 [2018-04-11 17:26:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:15,292 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-04-11 17:26:15,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 17:26:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-04-11 17:26:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 17:26:15,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:15,293 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:15,293 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash -219298715, now seen corresponding path program 1 times [2018-04-11 17:26:15,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:15,293 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:15,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:15,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:15,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:15,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:15,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:15,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 17:26:15,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 17:26:15,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 17:26:15,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:26:15,355 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 7 states. [2018-04-11 17:26:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:15,524 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2018-04-11 17:26:15,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 17:26:15,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-04-11 17:26:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:15,525 INFO L225 Difference]: With dead ends: 135 [2018-04-11 17:26:15,525 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 17:26:15,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-04-11 17:26:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 17:26:15,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 99. [2018-04-11 17:26:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 17:26:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-04-11 17:26:15,528 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 26 [2018-04-11 17:26:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:15,531 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-04-11 17:26:15,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 17:26:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-04-11 17:26:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 17:26:15,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:15,532 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:15,532 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:15,532 INFO L82 PathProgramCache]: Analyzing trace with hash 931644511, now seen corresponding path program 1 times [2018-04-11 17:26:15,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:15,532 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:15,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:15,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:15,533 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:15,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:15,549 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:15,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:15,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:15,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:15,574 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:15,617 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~0.base Int)) (and (= 0 (select |c_old(#valid)| main_~p~0.base)) (= (store |c_old(#valid)| main_~p~0.base 0) |c_#valid|))) is different from true [2018-04-11 17:26:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:15,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:15,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 17:26:15,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 17:26:15,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 17:26:15,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2018-04-11 17:26:15,621 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 7 states. [2018-04-11 17:26:15,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:15,725 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-04-11 17:26:15,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:26:15,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-04-11 17:26:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:15,726 INFO L225 Difference]: With dead ends: 117 [2018-04-11 17:26:15,726 INFO L226 Difference]: Without dead ends: 112 [2018-04-11 17:26:15,726 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=50, Unknown=2, NotChecked=14, Total=90 [2018-04-11 17:26:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-11 17:26:15,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2018-04-11 17:26:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 17:26:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-04-11 17:26:15,728 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 27 [2018-04-11 17:26:15,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:15,729 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-04-11 17:26:15,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 17:26:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-04-11 17:26:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 17:26:15,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:15,729 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:15,729 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2141170354, now seen corresponding path program 1 times [2018-04-11 17:26:15,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:15,729 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:15,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:15,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:15,730 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:15,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:15,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:15,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 17:26:15,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 17:26:15,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 17:26:15,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:26:15,775 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 7 states. [2018-04-11 17:26:15,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:15,870 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-04-11 17:26:15,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 17:26:15,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-04-11 17:26:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:15,871 INFO L225 Difference]: With dead ends: 128 [2018-04-11 17:26:15,871 INFO L226 Difference]: Without dead ends: 119 [2018-04-11 17:26:15,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:26:15,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-11 17:26:15,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2018-04-11 17:26:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 17:26:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-04-11 17:26:15,874 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 29 [2018-04-11 17:26:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:15,874 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-04-11 17:26:15,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 17:26:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-04-11 17:26:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 17:26:15,875 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:15,875 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:15,875 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:15,875 INFO L82 PathProgramCache]: Analyzing trace with hash -258024629, now seen corresponding path program 1 times [2018-04-11 17:26:15,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:15,876 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:15,876 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:15,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:15,877 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:15,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:16,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:16,024 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:16,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:16,066 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:16,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:16,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-11 17:26:16,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:16,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:16,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-04-11 17:26:16,173 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 21 treesize of output 17 [2018-04-11 17:26:16,175 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:16,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 17:26:16,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:5 [2018-04-11 17:26:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:16,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:26:16,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-04-11 17:26:16,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:26:16,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:26:16,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:26:16,191 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 20 states. [2018-04-11 17:26:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:16,647 INFO L93 Difference]: Finished difference Result 179 states and 199 transitions. [2018-04-11 17:26:16,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 17:26:16,647 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2018-04-11 17:26:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:16,648 INFO L225 Difference]: With dead ends: 179 [2018-04-11 17:26:16,648 INFO L226 Difference]: Without dead ends: 179 [2018-04-11 17:26:16,649 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2018-04-11 17:26:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-04-11 17:26:16,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 122. [2018-04-11 17:26:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 17:26:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-04-11 17:26:16,652 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 37 [2018-04-11 17:26:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:16,652 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-04-11 17:26:16,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:26:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-04-11 17:26:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 17:26:16,654 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:16,654 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:16,654 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:16,654 INFO L82 PathProgramCache]: Analyzing trace with hash -258024628, now seen corresponding path program 1 times [2018-04-11 17:26:16,654 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:16,654 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:16,655 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:16,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:16,655 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:16,666 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:16,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:16,789 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:16,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:16,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:16,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:16,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-11 17:26:16,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:16,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:16,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:16,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:16,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,919 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2018-04-11 17:26:16,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 17:26:16,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 17:26:16,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:16,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:26:16,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-04-11 17:26:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:16,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:26:16,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-04-11 17:26:16,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 17:26:16,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 17:26:16,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-04-11 17:26:16,994 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand 19 states. [2018-04-11 17:26:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:17,356 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2018-04-11 17:26:17,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 17:26:17,356 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-04-11 17:26:17,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:17,357 INFO L225 Difference]: With dead ends: 209 [2018-04-11 17:26:17,357 INFO L226 Difference]: Without dead ends: 209 [2018-04-11 17:26:17,358 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-04-11 17:26:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-11 17:26:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 127. [2018-04-11 17:26:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 17:26:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2018-04-11 17:26:17,360 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 37 [2018-04-11 17:26:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:17,360 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2018-04-11 17:26:17,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 17:26:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2018-04-11 17:26:17,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 17:26:17,361 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:17,361 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:17,361 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:17,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1986336881, now seen corresponding path program 1 times [2018-04-11 17:26:17,361 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:17,361 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:17,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:17,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:17,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:17,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:17,373 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:17,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:17,373 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:17,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:17,393 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:17,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:17,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:17,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 17:26:17,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:17,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:17,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:26:17,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-04-11 17:26:17,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:17,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:17,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:17,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,483 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:47, output treesize:30 [2018-04-11 17:26:17,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-11 17:26:17,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 17:26:17,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:17,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2018-04-11 17:26:17,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 17:26:17,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:17,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:17,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2018-04-11 17:26:17,580 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-04-11 17:26:17,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:17,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,594 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:17,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:26:17,595 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,602 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2018-04-11 17:26:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:17,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:17,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 17:26:17,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 17:26:17,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 17:26:17,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:26:17,613 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand 14 states. [2018-04-11 17:26:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:18,019 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2018-04-11 17:26:18,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 17:26:18,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-04-11 17:26:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:18,020 INFO L225 Difference]: With dead ends: 206 [2018-04-11 17:26:18,020 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 17:26:18,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-04-11 17:26:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 17:26:18,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 127. [2018-04-11 17:26:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 17:26:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2018-04-11 17:26:18,022 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 39 [2018-04-11 17:26:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:18,022 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2018-04-11 17:26:18,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 17:26:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2018-04-11 17:26:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 17:26:18,023 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:18,023 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-11 17:26:18,023 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:18,023 INFO L82 PathProgramCache]: Analyzing trace with hash -675740828, now seen corresponding path program 1 times [2018-04-11 17:26:18,023 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:18,023 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:18,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:18,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:18,024 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:18,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:18,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:18,166 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:18,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:18,191 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:18,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:18,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-11 17:26:18,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:18,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:18,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 17:26:18,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-04-11 17:26:18,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:26:18,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:18,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-11 17:26:18,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 17:26:18,417 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:18,417 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 28 treesize of output 20 [2018-04-11 17:26:18,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 17:26:18,434 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:18,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:18,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:18,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:18,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:64, output treesize:19 [2018-04-11 17:26:18,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:18,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 17:26:18,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:18,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:18,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:18,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-04-11 17:26:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:18,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:26:18,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 27 [2018-04-11 17:26:18,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 17:26:18,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 17:26:18,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2018-04-11 17:26:18,590 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand 27 states. [2018-04-11 17:26:19,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:19,298 INFO L93 Difference]: Finished difference Result 174 states and 186 transitions. [2018-04-11 17:26:19,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 17:26:19,298 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 45 [2018-04-11 17:26:19,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:19,299 INFO L225 Difference]: With dead ends: 174 [2018-04-11 17:26:19,299 INFO L226 Difference]: Without dead ends: 174 [2018-04-11 17:26:19,299 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 17:26:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-04-11 17:26:19,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2018-04-11 17:26:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 17:26:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-04-11 17:26:19,301 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 45 [2018-04-11 17:26:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:19,301 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-04-11 17:26:19,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 17:26:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-04-11 17:26:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 17:26:19,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:19,302 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:19,302 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:19,303 INFO L82 PathProgramCache]: Analyzing trace with hash 354367232, now seen corresponding path program 1 times [2018-04-11 17:26:19,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:19,303 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:19,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:19,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:19,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:19,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:26:19,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:19,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:19,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:19,390 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:19,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:19,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:19,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 17:26:19,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:19,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:19,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-11 17:26:19,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:19,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 17:26:19,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:19,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:19,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 17:26:19,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-04-11 17:26:19,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-11 17:26:19,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:19,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:19,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,535 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30 [2018-04-11 17:26:19,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-11 17:26:19,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 17:26:19,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:19,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2018-04-11 17:26:19,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 17:26:19,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:19,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:19,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2018-04-11 17:26:19,654 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-04-11 17:26:19,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 5 treesize of output 1 [2018-04-11 17:26:19,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 17:26:19,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:19,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:19,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:19,672 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:21 [2018-04-11 17:26:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:26:19,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:26:19,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 21 [2018-04-11 17:26:19,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 17:26:19,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 17:26:19,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-04-11 17:26:19,715 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 21 states. [2018-04-11 17:26:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:20,664 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2018-04-11 17:26:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 17:26:20,664 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 47 [2018-04-11 17:26:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:20,665 INFO L225 Difference]: With dead ends: 176 [2018-04-11 17:26:20,665 INFO L226 Difference]: Without dead ends: 176 [2018-04-11 17:26:20,665 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=331, Invalid=1391, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 17:26:20,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-11 17:26:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 123. [2018-04-11 17:26:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 17:26:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-04-11 17:26:20,668 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 47 [2018-04-11 17:26:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:20,668 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-04-11 17:26:20,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 17:26:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-04-11 17:26:20,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 17:26:20,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:20,669 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:20,669 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1428486419, now seen corresponding path program 1 times [2018-04-11 17:26:20,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:20,669 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:20,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:20,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:20,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:20,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:20,681 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:20,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:20,681 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:20,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:20,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:20,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:20,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:20,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:26:20,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 17:26:20,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:20,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:20,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 17:26:20,912 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 31 treesize of output 25 [2018-04-11 17:26:20,914 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:20,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 17:26:20,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:15 [2018-04-11 17:26:20,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:20,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:26:20,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:20,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 17:26:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:26:20,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:20,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:26:20,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:26:20,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:26:20,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:26:20,994 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 17 states. [2018-04-11 17:26:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:21,394 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-04-11 17:26:21,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 17:26:21,395 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-11 17:26:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:21,395 INFO L225 Difference]: With dead ends: 162 [2018-04-11 17:26:21,395 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 17:26:21,396 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-04-11 17:26:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 17:26:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 134. [2018-04-11 17:26:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-11 17:26:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2018-04-11 17:26:21,398 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 49 [2018-04-11 17:26:21,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:21,398 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2018-04-11 17:26:21,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:26:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2018-04-11 17:26:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 17:26:21,399 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:21,399 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:21,399 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1428486420, now seen corresponding path program 1 times [2018-04-11 17:26:21,399 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:21,400 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:21,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:21,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:21,400 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:21,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:26:21,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:21,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:21,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:21,576 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26: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 6 treesize of output 5 [2018-04-11 17:26:21,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:21,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:21,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:21,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:21,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 17:26:21,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:21,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:21,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 17:26:21,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:21,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 17:26:21,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:21,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:21,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 17:26:21,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:21,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:21,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:21,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:21,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:21,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:21,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:21,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:21,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:21,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:46 [2018-04-11 17:26:21,795 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 31 treesize of output 25 [2018-04-11 17:26:21,800 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 25 treesize of output 22 [2018-04-11 17:26:21,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:21,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:21,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 17:26:21,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 17:26:21,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:21,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:21,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2018-04-11 17:26:21,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:70, output treesize:191 [2018-04-11 17:26:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:26:21,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:26:21,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2018-04-11 17:26:21,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 17:26:21,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 17:26:21,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-04-11 17:26:21,957 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand 25 states. [2018-04-11 17:26:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:22,996 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2018-04-11 17:26:22,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 17:26:22,996 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-04-11 17:26:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:22,997 INFO L225 Difference]: With dead ends: 183 [2018-04-11 17:26:22,997 INFO L226 Difference]: Without dead ends: 183 [2018-04-11 17:26:22,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=1321, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 17:26:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-11 17:26:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2018-04-11 17:26:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 17:26:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2018-04-11 17:26:23,000 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 49 [2018-04-11 17:26:23,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:23,001 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2018-04-11 17:26:23,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 17:26:23,001 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2018-04-11 17:26:23,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 17:26:23,001 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:23,001 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:23,001 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:23,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1313673559, now seen corresponding path program 1 times [2018-04-11 17:26:23,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:23,002 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:23,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:23,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:23,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:23,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:23,015 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:23,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:23,015 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:23,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:23,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:23,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:23,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:26:23,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 17:26:23,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:23,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:23,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,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-04-11 17:26:23,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 17:26:23,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-04-11 17:26:23,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:23 [2018-04-11 17:26:23,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-11 17:26:23,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:26:23,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:25 [2018-04-11 17:26:23,251 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 31 treesize of output 25 [2018-04-11 17:26:23,253 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:23,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 17:26:23,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:5 [2018-04-11 17:26:23,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:23,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:23,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:26:23,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:26:23,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:26:23,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:26:23,276 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand 17 states. [2018-04-11 17:26:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:23,713 INFO L93 Difference]: Finished difference Result 233 states and 254 transitions. [2018-04-11 17:26:23,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 17:26:23,713 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-11 17:26:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:23,714 INFO L225 Difference]: With dead ends: 233 [2018-04-11 17:26:23,714 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 17:26:23,714 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 17:26:23,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 17:26:23,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 171. [2018-04-11 17:26:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-11 17:26:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 188 transitions. [2018-04-11 17:26:23,717 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 188 transitions. Word has length 49 [2018-04-11 17:26:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:23,718 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 188 transitions. [2018-04-11 17:26:23,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:26:23,718 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2018-04-11 17:26:23,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 17:26:23,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:23,718 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:23,719 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:23,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1313673560, now seen corresponding path program 1 times [2018-04-11 17:26:23,719 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:23,719 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:23,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:23,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:23,720 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:23,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:23,733 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:23,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:23,733 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:23,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:23,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:23,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:23,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:23,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:26:23,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:23,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 17:26:23,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:23,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:23,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:23,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:23,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-04-11 17:26:23,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:23,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:23,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:23,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 17:26:23,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,975 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 18 treesize of output 27 [2018-04-11 17:26:23,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:23,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:62 [2018-04-11 17:26:24,039 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 35 treesize of output 36 [2018-04-11 17:26:24,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:26:24,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:24,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:24,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-04-11 17:26:24,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:26:24,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:24,076 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:24,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:24,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:103, output treesize:53 [2018-04-11 17:26:24,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-11 17:26:24,156 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:24,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21 [2018-04-11 17:26:24,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:24,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:24,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 15 [2018-04-11 17:26:24,182 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:24,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:24,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:24,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:24,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:24,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:77, output treesize:18 [2018-04-11 17:26:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:24,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:24,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:26:24,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:26:24,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:26:24,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:26:24,251 INFO L87 Difference]: Start difference. First operand 171 states and 188 transitions. Second operand 17 states. [2018-04-11 17:26:26,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:26,440 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2018-04-11 17:26:26,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 17:26:26,440 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-11 17:26:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:26,441 INFO L225 Difference]: With dead ends: 260 [2018-04-11 17:26:26,441 INFO L226 Difference]: Without dead ends: 260 [2018-04-11 17:26:26,441 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 17:26:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-11 17:26:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 176. [2018-04-11 17:26:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 17:26:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 194 transitions. [2018-04-11 17:26:26,443 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 194 transitions. Word has length 49 [2018-04-11 17:26:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:26,444 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 194 transitions. [2018-04-11 17:26:26,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:26:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 194 transitions. [2018-04-11 17:26:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 17:26:26,444 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:26,444 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:26,444 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:26,444 INFO L82 PathProgramCache]: Analyzing trace with hash 559807357, now seen corresponding path program 1 times [2018-04-11 17:26:26,444 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:26,444 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:26,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:26,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:26,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:26,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:26,454 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:26,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:26,455 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:26,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:26,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:26,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:26,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:26,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:26,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:26,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:25 [2018-04-11 17:26:26,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:26,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:26,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:26:26,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-04-11 17:26:26,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:26,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:26,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:46 [2018-04-11 17:26:26,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:26,671 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 26 [2018-04-11 17:26:26,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:26:26,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:26,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:65 [2018-04-11 17:26:26,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:26,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:26,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:26,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 17:26:26,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:26,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:63 [2018-04-11 17:26:26,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:26,767 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 56 treesize of output 57 [2018-04-11 17:26:26,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:26,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:26,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:75 [2018-04-11 17:26:26,813 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 77 treesize of output 54 [2018-04-11 17:26:26,815 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 28 treesize of output 13 [2018-04-11 17:26:26,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-04-11 17:26:26,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:26,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:26,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:26,831 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:93, output treesize:36 [2018-04-11 17:26:26,876 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 26 treesize of output 35 [2018-04-11 17:26:26,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-04-11 17:26:26,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:26,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:43 [2018-04-11 17:26:26,969 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 29 treesize of output 33 [2018-04-11 17:26:26,972 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:26,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:26:26,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:26,982 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:26,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:26,997 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:53, output treesize:3 [2018-04-11 17:26:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:27,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:27,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 17:26:27,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:26:27,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:26:27,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:26:27,021 INFO L87 Difference]: Start difference. First operand 176 states and 194 transitions. Second operand 20 states. [2018-04-11 17:26:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:28,289 INFO L93 Difference]: Finished difference Result 263 states and 289 transitions. [2018-04-11 17:26:28,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 17:26:28,289 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 51 [2018-04-11 17:26:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:28,290 INFO L225 Difference]: With dead ends: 263 [2018-04-11 17:26:28,290 INFO L226 Difference]: Without dead ends: 263 [2018-04-11 17:26:28,290 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=260, Invalid=1300, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 17:26:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-11 17:26:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 181. [2018-04-11 17:26:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-11 17:26:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 199 transitions. [2018-04-11 17:26:28,293 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 199 transitions. Word has length 51 [2018-04-11 17:26:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:28,293 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 199 transitions. [2018-04-11 17:26:28,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:26:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 199 transitions. [2018-04-11 17:26:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 17:26:28,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:28,293 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:28,293 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 354083203, now seen corresponding path program 2 times [2018-04-11 17:26:28,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:28,294 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:28,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:28,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:28,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:28,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:28,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:28,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:26:28,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 17:26:28,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 17:26:28,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:26:28,314 INFO L87 Difference]: Start difference. First operand 181 states and 199 transitions. Second operand 3 states. [2018-04-11 17:26:28,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:28,322 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2018-04-11 17:26:28,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 17:26:28,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-04-11 17:26:28,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:28,325 INFO L225 Difference]: With dead ends: 197 [2018-04-11 17:26:28,325 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 17:26:28,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 17:26:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 17:26:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 165. [2018-04-11 17:26:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-11 17:26:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2018-04-11 17:26:28,328 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 51 [2018-04-11 17:26:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:28,328 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2018-04-11 17:26:28,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 17:26:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2018-04-11 17:26:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 17:26:28,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:28,329 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-11 17:26:28,329 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash -650862252, now seen corresponding path program 1 times [2018-04-11 17:26:28,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:28,330 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:28,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:28,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:28,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:28,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:26:28,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:28,440 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:28,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:28,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:28,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:28,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:28,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:28,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:28,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:28,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 17:26:28,634 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-04-11 17:26:28,636 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:28,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-04-11 17:26:28,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:28,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:28,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:28,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-04-11 17:26:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:26:28,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:26:28,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 23 [2018-04-11 17:26:28,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 17:26:28,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 17:26:28,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:26:28,664 INFO L87 Difference]: Start difference. First operand 165 states and 177 transitions. Second operand 24 states. [2018-04-11 17:26:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:29,235 INFO L93 Difference]: Finished difference Result 193 states and 204 transitions. [2018-04-11 17:26:29,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 17:26:29,239 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 53 [2018-04-11 17:26:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:29,240 INFO L225 Difference]: With dead ends: 193 [2018-04-11 17:26:29,240 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 17:26:29,241 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=389, Invalid=1333, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 17:26:29,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 17:26:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 164. [2018-04-11 17:26:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-04-11 17:26:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 176 transitions. [2018-04-11 17:26:29,244 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 176 transitions. Word has length 53 [2018-04-11 17:26:29,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:29,244 INFO L459 AbstractCegarLoop]: Abstraction has 164 states and 176 transitions. [2018-04-11 17:26:29,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 17:26:29,245 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 176 transitions. [2018-04-11 17:26:29,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 17:26:29,245 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:29,245 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:29,245 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:29,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1541721830, now seen corresponding path program 1 times [2018-04-11 17:26:29,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:29,246 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:29,246 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:29,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:29,247 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:29,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:29,260 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:29,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:29,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:29,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:29,287 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:29,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:29,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:29,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:29,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:29,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:29,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:41 [2018-04-11 17:26:29,418 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 39 treesize of output 33 [2018-04-11 17:26:29,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-04-11 17:26:29,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:29,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:29,449 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-04-11 17:26:29,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:56 [2018-04-11 17:26:29,522 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~tmp~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~tmp~0.base 1))) (and (= 0 (select |c_old(#valid)| main_~tmp~0.base)) (= (select .cse0 c_main_~p~0.base) 0) (= |c_#valid| (store (store .cse0 c_main_~p~0.base 1) main_~tmp~0.base 0))))) is different from true [2018-04-11 17:26:29,525 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~p~0.base Int) (main_~tmp~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~tmp~0.base 1))) (and (= 0 (select |c_old(#valid)| main_~tmp~0.base)) (= |c_#valid| (store (store (store .cse0 main_~p~0.base 1) main_~tmp~0.base 0) main_~p~0.base 0)) (= (select .cse0 main_~p~0.base) 0)))) is different from true [2018-04-11 17:26:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2018-04-11 17:26:29,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:29,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:26:29,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 17:26:29,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 17:26:29,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=182, Unknown=2, NotChecked=54, Total=272 [2018-04-11 17:26:29,535 INFO L87 Difference]: Start difference. First operand 164 states and 176 transitions. Second operand 17 states. [2018-04-11 17:26:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:30,041 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2018-04-11 17:26:30,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 17:26:30,041 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-04-11 17:26:30,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:30,042 INFO L225 Difference]: With dead ends: 169 [2018-04-11 17:26:30,042 INFO L226 Difference]: Without dead ends: 164 [2018-04-11 17:26:30,042 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=514, Unknown=2, NotChecked=94, Total=702 [2018-04-11 17:26:30,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-11 17:26:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-04-11 17:26:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 17:26:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 172 transitions. [2018-04-11 17:26:30,045 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 172 transitions. Word has length 55 [2018-04-11 17:26:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:30,046 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 172 transitions. [2018-04-11 17:26:30,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 17:26:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2018-04-11 17:26:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 17:26:30,046 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:30,046 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:30,046 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash 14954361, now seen corresponding path program 2 times [2018-04-11 17:26:30,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:30,047 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:30,047 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:30,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:30,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:30,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:30,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:30,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:30,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:26:30,256 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:26:30,256 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:30,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:30,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:30,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:30,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:30,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:30,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:16 [2018-04-11 17:26:30,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 17:26:30,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 17:26:30,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2018-04-11 17:26:30,377 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 23 treesize of output 14 [2018-04-11 17:26:30,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 14 treesize of output 13 [2018-04-11 17:26:30,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:30,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2018-04-11 17:26:30,422 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-04-11 17:26:30,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 19 treesize of output 7 [2018-04-11 17:26:30,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:30,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:30,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-04-11 17:26:30,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:30,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:30,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:30,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:30,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:30,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-04-11 17:26:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:26:30,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:26:30,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 29 [2018-04-11 17:26:30,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 17:26:30,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 17:26:30,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2018-04-11 17:26:30,484 INFO L87 Difference]: Start difference. First operand 161 states and 172 transitions. Second operand 29 states. [2018-04-11 17:26:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:31,009 INFO L93 Difference]: Finished difference Result 173 states and 182 transitions. [2018-04-11 17:26:31,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 17:26:31,009 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-04-11 17:26:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:31,009 INFO L225 Difference]: With dead ends: 173 [2018-04-11 17:26:31,010 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 17:26:31,010 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=322, Invalid=1934, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 17:26:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 17:26:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2018-04-11 17:26:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 17:26:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2018-04-11 17:26:31,012 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 57 [2018-04-11 17:26:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:31,012 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2018-04-11 17:26:31,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 17:26:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2018-04-11 17:26:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 17:26:31,012 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:31,012 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:31,012 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:31,012 INFO L82 PathProgramCache]: Analyzing trace with hash 168193392, now seen corresponding path program 1 times [2018-04-11 17:26:31,012 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:31,013 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:31,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:31,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:31,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:31,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:31,026 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:31,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:31,026 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:31,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:31,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:31,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:31,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:31,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:26:31,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:31,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 17:26:31,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:31,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:31,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:31,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:31,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,162 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:56 [2018-04-11 17:26:31,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 17:26:31,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-11 17:26:31,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:53 [2018-04-11 17:26:31,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:31,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 17:26:31,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:31,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:31,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:31,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 17:26:31,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:31,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:59 [2018-04-11 17:26:31,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:31,285 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 54 treesize of output 55 [2018-04-11 17:26:31,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:31,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:31,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:59 [2018-04-11 17:26:31,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:31,543 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:31,544 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 28 treesize of output 27 [2018-04-11 17:26:31,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:31,558 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:31,559 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 47 treesize of output 51 [2018-04-11 17:26:31,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:31,562 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 17 treesize of output 13 [2018-04-11 17:26:31,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,569 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-04-11 17:26:31,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:31,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:93, output treesize:5 [2018-04-11 17:26:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:31,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:31,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 17:26:31,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 17:26:31,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 17:26:31,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-04-11 17:26:31,614 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 23 states. [2018-04-11 17:26:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:32,762 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2018-04-11 17:26:32,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 17:26:32,762 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 57 [2018-04-11 17:26:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:32,763 INFO L225 Difference]: With dead ends: 187 [2018-04-11 17:26:32,763 INFO L226 Difference]: Without dead ends: 187 [2018-04-11 17:26:32,763 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=1663, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 17:26:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-11 17:26:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 142. [2018-04-11 17:26:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-11 17:26:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-04-11 17:26:32,765 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 57 [2018-04-11 17:26:32,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:32,765 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-04-11 17:26:32,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 17:26:32,765 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-04-11 17:26:32,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 17:26:32,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:32,765 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:32,766 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:32,766 INFO L82 PathProgramCache]: Analyzing trace with hash 168193393, now seen corresponding path program 1 times [2018-04-11 17:26:32,766 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:32,766 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:32,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:32,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:32,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:32,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:32,816 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:32,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:32,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:32,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:32,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:32,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:32,865 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:32,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:26:32,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:32,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:32,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 17:26:32,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:32,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:32,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:32,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:32,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:32,922 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:32,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:32,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:32,936 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:32,937 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:32,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:32,947 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:53, output treesize:29 [2018-04-11 17:26:33,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:33,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:52 [2018-04-11 17:26:33,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:33,074 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 32 treesize of output 39 [2018-04-11 17:26:33,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:26:33,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:33,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-04-11 17:26:33,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 10 treesize of output 9 [2018-04-11 17:26:33,108 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,131 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:70 [2018-04-11 17:26:33,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:33,460 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:33,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 80 [2018-04-11 17:26:33,466 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:33,467 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 17 treesize of output 13 [2018-04-11 17:26:33,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,479 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:33,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-04-11 17:26:33,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:33,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:33,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-04-11 17:26:33,521 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:33,521 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 22 treesize of output 14 [2018-04-11 17:26:33,522 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,531 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:33,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 17:26:33,532 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,537 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:33,548 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:115, output treesize:12 [2018-04-11 17:26:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:33,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:33,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 17:26:33,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 17:26:33,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 17:26:33,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2018-04-11 17:26:33,618 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 25 states. [2018-04-11 17:26:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:35,072 INFO L93 Difference]: Finished difference Result 210 states and 225 transitions. [2018-04-11 17:26:35,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 17:26:35,072 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-04-11 17:26:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:35,073 INFO L225 Difference]: With dead ends: 210 [2018-04-11 17:26:35,073 INFO L226 Difference]: Without dead ends: 210 [2018-04-11 17:26:35,074 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=336, Invalid=1920, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 17:26:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-11 17:26:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 143. [2018-04-11 17:26:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 17:26:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-04-11 17:26:35,075 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 57 [2018-04-11 17:26:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:35,075 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-04-11 17:26:35,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 17:26:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-04-11 17:26:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 17:26:35,076 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:35,076 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-04-11 17:26:35,076 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1867939103, now seen corresponding path program 1 times [2018-04-11 17:26:35,076 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:35,076 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:35,077 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:35,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:35,077 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:35,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:35,091 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:35,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:35,091 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:35,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:35,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:35,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:35,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:35,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:26:35,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 17:26:35,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:35,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:35,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-04-11 17:26:35,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-11 17:26:35,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2018-04-11 17:26:35,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-11 17:26:35,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:26:35,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:18 [2018-04-11 17:26:35,329 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 27 treesize of output 21 [2018-04-11 17:26:35,333 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 21 treesize of output 20 [2018-04-11 17:26:35,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:35,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:35,346 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-04-11 17:26:35,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2018-04-11 17:26:35,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:35,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 17:26:35,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:35,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:35,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 17:26:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:26:35,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:35,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 17:26:35,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:26:35,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:26:35,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:26:35,465 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 20 states. [2018-04-11 17:26:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:36,073 INFO L93 Difference]: Finished difference Result 201 states and 217 transitions. [2018-04-11 17:26:36,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 17:26:36,073 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-04-11 17:26:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:36,075 INFO L225 Difference]: With dead ends: 201 [2018-04-11 17:26:36,075 INFO L226 Difference]: Without dead ends: 201 [2018-04-11 17:26:36,076 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1087, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 17:26:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-04-11 17:26:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 174. [2018-04-11 17:26:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 17:26:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2018-04-11 17:26:36,079 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 61 [2018-04-11 17:26:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:36,079 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2018-04-11 17:26:36,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:26:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-04-11 17:26:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 17:26:36,080 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:36,080 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-04-11 17:26:36,080 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1867939104, now seen corresponding path program 1 times [2018-04-11 17:26:36,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:36,080 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:36,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:36,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:36,081 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:36,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:36,093 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:36,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:36,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:36,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:36,125 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:36,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:36,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:36,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 17:26:36,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:26:36,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-04-11 17:26:36,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:36,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:36,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:36,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:36,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,260 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:58 [2018-04-11 17:26:36,320 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 12 [2018-04-11 17:26:36,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:36,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:72, output treesize:72 [2018-04-11 17:26:36,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,356 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 21 treesize of output 40 [2018-04-11 17:26:36,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,374 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 20 treesize of output 28 [2018-04-11 17:26:36,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:75 [2018-04-11 17:26:36,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,433 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 28 treesize of output 33 [2018-04-11 17:26:36,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:26:36,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,495 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 82 [2018-04-11 17:26:36,500 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 22 treesize of output 18 [2018-04-11 17:26:36,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,525 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:85 [2018-04-11 17:26:36,617 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 43 treesize of output 48 [2018-04-11 17:26:36,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17 [2018-04-11 17:26:36,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:36,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:121, output treesize:107 [2018-04-11 17:26:36,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-11 17:26:36,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:36,752 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 70 treesize of output 61 [2018-04-11 17:26:36,754 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:36,760 INFO L477 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 37 treesize of output 41 [2018-04-11 17:26:36,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:36,790 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 27 [2018-04-11 17:26:36,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:36,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:36,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 18 [2018-04-11 17:26:36,812 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:36,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 17:26:36,813 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,816 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:36,826 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:135, output treesize:28 [2018-04-11 17:26:36,879 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-04-11 17:26:36,880 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:36,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:26:36,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:36,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:36,890 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:38, output treesize:3 [2018-04-11 17:26:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 17:26:36,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:36,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 17:26:36,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 17:26:36,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 17:26:36,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2018-04-11 17:26:36,919 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand 23 states. [2018-04-11 17:26:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:38,230 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2018-04-11 17:26:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 17:26:38,230 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2018-04-11 17:26:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:38,231 INFO L225 Difference]: With dead ends: 213 [2018-04-11 17:26:38,231 INFO L226 Difference]: Without dead ends: 213 [2018-04-11 17:26:38,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=268, Invalid=1624, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 17:26:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-04-11 17:26:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 174. [2018-04-11 17:26:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-04-11 17:26:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 195 transitions. [2018-04-11 17:26:38,233 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 195 transitions. Word has length 61 [2018-04-11 17:26:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:38,234 INFO L459 AbstractCegarLoop]: Abstraction has 174 states and 195 transitions. [2018-04-11 17:26:38,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 17:26:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 195 transitions. [2018-04-11 17:26:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 17:26:38,234 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:38,234 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:26:38,234 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1675016983, now seen corresponding path program 2 times [2018-04-11 17:26:38,235 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:38,235 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:38,235 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:38,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:38,236 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:38,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:38,248 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:38,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:38,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:38,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:26:38,281 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:26:38,281 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:38,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:38,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:38,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:38,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:38,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:38,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:38,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 17:26:38,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:38,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:38,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 17:26:38,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:38,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:38,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:38,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-04-11 17:26:38,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:38,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 17:26:38,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:38,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:38 [2018-04-11 17:26:38,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 17:26:38,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:38,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:61 [2018-04-11 17:26:38,583 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 75 treesize of output 73 [2018-04-11 17:26:38,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 81 [2018-04-11 17:26:38,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,623 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 49 treesize of output 61 [2018-04-11 17:26:38,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:38,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:38,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:38,661 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:67 [2018-04-11 17:26:38,760 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 31 treesize of output 25 [2018-04-11 17:26:38,762 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:38,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 17:26:38,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:38,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:38,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:15 [2018-04-11 17:26:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:38,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:38,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 17:26:38,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:26:38,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:26:38,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:26:38,847 INFO L87 Difference]: Start difference. First operand 174 states and 195 transitions. Second operand 20 states. [2018-04-11 17:26:39,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:39,619 INFO L93 Difference]: Finished difference Result 253 states and 280 transitions. [2018-04-11 17:26:39,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 17:26:39,620 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-04-11 17:26:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:39,620 INFO L225 Difference]: With dead ends: 253 [2018-04-11 17:26:39,620 INFO L226 Difference]: Without dead ends: 253 [2018-04-11 17:26:39,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=261, Invalid=1221, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 17:26:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-11 17:26:39,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 198. [2018-04-11 17:26:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-11 17:26:39,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 222 transitions. [2018-04-11 17:26:39,623 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 222 transitions. Word has length 61 [2018-04-11 17:26:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:39,624 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 222 transitions. [2018-04-11 17:26:39,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:26:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 222 transitions. [2018-04-11 17:26:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 17:26:39,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:39,625 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:26:39,625 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1675016982, now seen corresponding path program 2 times [2018-04-11 17:26:39,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:39,625 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:39,625 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:39,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:39,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:39,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:39,638 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:39,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:39,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:39,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:26:39,669 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:26:39,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:39,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:39,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:39,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:39,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 17:26:39,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:39,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 17:26:39,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:39,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:39,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:39,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-11 17:26:39,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:39,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:39,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:39,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:39,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,840 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:50 [2018-04-11 17:26:39,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:39,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:39,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:39,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:39,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 17:26:39,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:39,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 17:26:39,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:82 [2018-04-11 17:26:40,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:40,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2018-04-11 17:26:40,074 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 10 treesize of output 9 [2018-04-11 17:26:40,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:40,104 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 23 treesize of output 30 [2018-04-11 17:26:40,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:26:40,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,125 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:100 [2018-04-11 17:26:40,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:40,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:40,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:40,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:40,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 129 [2018-04-11 17:26:40,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 117 [2018-04-11 17:26:40,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:40,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:159, output treesize:182 [2018-04-11 17:26:40,333 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 154 [2018-04-11 17:26:40,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21 [2018-04-11 17:26:40,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 17:26:40,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21 [2018-04-11 17:26:40,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:40,431 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:241, output treesize:167 [2018-04-11 17:26:40,513 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 67 [2018-04-11 17:26:40,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:40,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:148, output treesize:111 [2018-04-11 17:26:40,588 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 94 treesize of output 60 [2018-04-11 17:26:40,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2018-04-11 17:26:40,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:40,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-04-11 17:26:40,600 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:40,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:40,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:26:40,620 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,621 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:40,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:40,630 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:127, output treesize:48 [2018-04-11 17:26:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:40,706 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:40,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 17:26:40,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 17:26:40,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 17:26:40,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2018-04-11 17:26:40,707 INFO L87 Difference]: Start difference. First operand 198 states and 222 transitions. Second operand 22 states. [2018-04-11 17:26:43,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:43,804 INFO L93 Difference]: Finished difference Result 257 states and 285 transitions. [2018-04-11 17:26:43,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 17:26:43,805 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-04-11 17:26:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:43,805 INFO L225 Difference]: With dead ends: 257 [2018-04-11 17:26:43,806 INFO L226 Difference]: Without dead ends: 257 [2018-04-11 17:26:43,806 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=1382, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 17:26:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-11 17:26:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 203. [2018-04-11 17:26:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 17:26:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 227 transitions. [2018-04-11 17:26:43,808 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 227 transitions. Word has length 61 [2018-04-11 17:26:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:43,808 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 227 transitions. [2018-04-11 17:26:43,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 17:26:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 227 transitions. [2018-04-11 17:26:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 17:26:43,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:43,809 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:26:43,809 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1761317519, now seen corresponding path program 2 times [2018-04-11 17:26:43,809 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:43,809 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:43,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:43,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:43,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:43,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:43,822 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:43,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:43,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:43,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:26:43,841 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:26:43,841 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:43,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:43,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:43,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:43,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 17:26:43,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-04-11 17:26:43,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:43,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-11 17:26:43,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:43,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:43,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:26:43,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 17:26:43,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:41 [2018-04-11 17:26:43,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-04-11 17:26:43,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:43,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:43,957 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:43,968 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2018-04-11 17:26:44,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,011 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 26 [2018-04-11 17:26:44,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:26:44,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:65 [2018-04-11 17:26:44,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-04-11 17:26:44,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:84 [2018-04-11 17:26:44,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,096 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 67 treesize of output 68 [2018-04-11 17:26:44,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:44,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:102 [2018-04-11 17:26:44,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,196 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 32 treesize of output 65 [2018-04-11 17:26:44,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 17:26:44,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:137, output treesize:145 [2018-04-11 17:26:44,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,253 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 86 [2018-04-11 17:26:44,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:150, output treesize:142 [2018-04-11 17:26:44,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:44,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 125 [2018-04-11 17:26:44,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-11 17:26:44,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:155, output treesize:160 [2018-04-11 17:26:44,399 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 104 [2018-04-11 17:26:44,401 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 40 treesize of output 21 [2018-04-11 17:26:44,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,410 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 40 treesize of output 24 [2018-04-11 17:26:44,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,419 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 36 treesize of output 20 [2018-04-11 17:26:44,420 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:202, output treesize:55 [2018-04-11 17:26:44,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-04-11 17:26:44,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:44,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:44,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:66, output treesize:62 [2018-04-11 17:26:44,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-04-11 17:26:44,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:44,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:44,648 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:44,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,655 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:44,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:26:44,655 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:44,666 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:72, output treesize:3 [2018-04-11 17:26:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:44,703 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:44,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 17:26:44,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 17:26:44,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 17:26:44,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-04-11 17:26:44,704 INFO L87 Difference]: Start difference. First operand 203 states and 227 transitions. Second operand 26 states. [2018-04-11 17:26:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:46,403 INFO L93 Difference]: Finished difference Result 266 states and 294 transitions. [2018-04-11 17:26:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 17:26:46,403 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-04-11 17:26:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:46,404 INFO L225 Difference]: With dead ends: 266 [2018-04-11 17:26:46,404 INFO L226 Difference]: Without dead ends: 266 [2018-04-11 17:26:46,405 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=327, Invalid=2223, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 17:26:46,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-11 17:26:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 203. [2018-04-11 17:26:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 17:26:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 226 transitions. [2018-04-11 17:26:46,407 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 226 transitions. Word has length 63 [2018-04-11 17:26:46,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:46,407 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 226 transitions. [2018-04-11 17:26:46,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 17:26:46,407 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 226 transitions. [2018-04-11 17:26:46,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 17:26:46,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:46,408 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:26:46,408 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash -323555649, now seen corresponding path program 2 times [2018-04-11 17:26:46,408 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:46,408 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:46,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:46,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:46,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:46,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:46,423 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:46,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:46,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:46,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:26:46,442 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:26:46,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:46,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:46,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:46,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:46,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:46,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:46,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:46,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:26:46,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 17:26:46,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:46,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:46,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:47 [2018-04-11 17:26:46,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:46,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 17:26:46,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:46,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:46,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:46,609 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 22 treesize of output 32 [2018-04-11 17:26:46,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:46,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:59 [2018-04-11 17:26:46,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-04-11 17:26:46,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:26:46,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:46,680 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 69 treesize of output 70 [2018-04-11 17:26:46,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:46,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:46,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:78 [2018-04-11 17:26:46,823 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 35 treesize of output 20 [2018-04-11 17:26:46,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 17:26:46,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:46,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:46,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:128, output treesize:112 [2018-04-11 17:26:47,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15 [2018-04-11 17:26:47,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:47,018 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 69 [2018-04-11 17:26:47,020 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:47,020 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 19 treesize of output 15 [2018-04-11 17:26:47,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:47,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-04-11 17:26:47,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:47,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:47,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-11 17:26:47,047 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:47,047 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 22 treesize of output 14 [2018-04-11 17:26:47,048 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:47,050 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:47,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:47,059 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:135, output treesize:17 [2018-04-11 17:26:47,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:47,109 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:47,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:26:47,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:47,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:47,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:47,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-04-11 17:26:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:47,149 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:47,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 17:26:47,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 17:26:47,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 17:26:47,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:26:47,149 INFO L87 Difference]: Start difference. First operand 203 states and 226 transitions. Second operand 24 states. [2018-04-11 17:26:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:48,583 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-04-11 17:26:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 17:26:48,583 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 65 [2018-04-11 17:26:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:48,584 INFO L225 Difference]: With dead ends: 210 [2018-04-11 17:26:48,584 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 17:26:48,584 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=1800, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 17:26:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 17:26:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 183. [2018-04-11 17:26:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-11 17:26:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2018-04-11 17:26:48,586 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 65 [2018-04-11 17:26:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:48,586 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2018-04-11 17:26:48,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 17:26:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2018-04-11 17:26:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 17:26:48,587 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:48,587 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:48,587 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:48,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1095664711, now seen corresponding path program 1 times [2018-04-11 17:26:48,587 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:48,587 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:48,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:48,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:48,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:48,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:48,594 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:48,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:48,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:48,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:48,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:48,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:48,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:48,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:48,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:26:48,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 17:26:48,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:48,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:48,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:48,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:48,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,720 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:53 [2018-04-11 17:26:48,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:48,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:26:48,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:48,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:48,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:48,817 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 20 treesize of output 28 [2018-04-11 17:26:48,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:48,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:59 [2018-04-11 17:26:48,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2018-04-11 17:26:48,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:26:48,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,886 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 36 treesize of output 37 [2018-04-11 17:26:48,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:26:48,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:48,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:48,902 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:94, output treesize:49 [2018-04-11 17:26:48,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-04-11 17:26:48,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 24 [2018-04-11 17:26:48,992 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:49,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:49,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 17:26:49,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 17:26:49,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:49,022 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:49,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 17:26:49,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:73, output treesize:94 [2018-04-11 17:26:49,144 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 17:26:49,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:49,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 17:26:49,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 17:26:49,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 17:26:49,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:26:49,144 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand 20 states. [2018-04-11 17:26:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:49,963 INFO L93 Difference]: Finished difference Result 217 states and 227 transitions. [2018-04-11 17:26:49,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 17:26:49,964 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 69 [2018-04-11 17:26:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:49,964 INFO L225 Difference]: With dead ends: 217 [2018-04-11 17:26:49,964 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 17:26:49,965 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 17:26:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 17:26:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 185. [2018-04-11 17:26:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 17:26:49,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-04-11 17:26:49,966 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 69 [2018-04-11 17:26:49,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:49,966 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-04-11 17:26:49,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 17:26:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-04-11 17:26:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 17:26:49,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:49,967 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:26:49,967 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:49,967 INFO L82 PathProgramCache]: Analyzing trace with hash -318312702, now seen corresponding path program 3 times [2018-04-11 17:26:49,967 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:49,967 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:49,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:49,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:49,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:49,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:49,980 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:49,980 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:49,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:49,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:26:50,004 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 17:26:50,004 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:50,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:50,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:50,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:50,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:50,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:50,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 17:26:50,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:50,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:50,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:50,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:50,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,112 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:48 [2018-04-11 17:26:50,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 17:26:50,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 17:26:50,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:50,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:89 [2018-04-11 17:26:50,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,328 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 23 treesize of output 30 [2018-04-11 17:26:50,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:26:50,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,364 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 71 [2018-04-11 17:26:50,366 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 10 treesize of output 9 [2018-04-11 17:26:50,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:50,392 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:125 [2018-04-11 17:26:50,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-04-11 17:26:50,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,442 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 42 treesize of output 26 [2018-04-11 17:26:50,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:50,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:189, output treesize:108 [2018-04-11 17:26:50,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,523 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 169 treesize of output 148 [2018-04-11 17:26:50,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 17:26:50,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,559 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 107 treesize of output 140 [2018-04-11 17:26:50,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 17:26:50,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:50,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:193, output treesize:95 [2018-04-11 17:26:50,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,695 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 34 treesize of output 32 [2018-04-11 17:26:50,697 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:50,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:50,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:26:50,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:50,713 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:116, output treesize:86 [2018-04-11 17:26:50,795 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:50,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:50,797 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 0 case distinctions, treesize of input 69 treesize of output 65 [2018-04-11 17:26:50,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:50,803 INFO L477 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 39 treesize of output 39 [2018-04-11 17:26:50,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:50,813 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 26 treesize of output 18 [2018-04-11 17:26:50,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:50,822 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:87, output treesize:5 [2018-04-11 17:26:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:50,878 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:50,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 17:26:50,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 17:26:50,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 17:26:50,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:26:50,879 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 24 states. [2018-04-11 17:26:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:52,204 INFO L93 Difference]: Finished difference Result 233 states and 250 transitions. [2018-04-11 17:26:52,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 17:26:52,204 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2018-04-11 17:26:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:52,205 INFO L225 Difference]: With dead ends: 233 [2018-04-11 17:26:52,205 INFO L226 Difference]: Without dead ends: 233 [2018-04-11 17:26:52,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=342, Invalid=1728, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 17:26:52,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-04-11 17:26:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 188. [2018-04-11 17:26:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 17:26:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2018-04-11 17:26:52,207 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 69 [2018-04-11 17:26:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:52,207 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-04-11 17:26:52,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 17:26:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2018-04-11 17:26:52,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 17:26:52,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:52,208 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:26:52,208 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:52,208 INFO L82 PathProgramCache]: Analyzing trace with hash -318312701, now seen corresponding path program 2 times [2018-04-11 17:26:52,208 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:52,208 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:52,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:52,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:52,208 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:52,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:52,233 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:52,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:52,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:52,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:26:52,253 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:26:52,253 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:52,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:52,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:52,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:52,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:52,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:26:52,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 17:26:52,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:52,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:52,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:52,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:52,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-04-11 17:26:52,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-11 17:26:52,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,434 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 18 treesize of output 27 [2018-04-11 17:26:52,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:95 [2018-04-11 17:26:52,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-04-11 17:26:52,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:26:52,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,523 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 80 treesize of output 92 [2018-04-11 17:26:52,525 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 22 treesize of output 18 [2018-04-11 17:26:52,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,560 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:123, output treesize:121 [2018-04-11 17:26:52,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2018-04-11 17:26:52,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 100 [2018-04-11 17:26:52,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:52,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:195, output treesize:224 [2018-04-11 17:26:52,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,742 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 97 [2018-04-11 17:26:52,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,772 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 224 treesize of output 216 [2018-04-11 17:26:52,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 17:26:52,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:52,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 187 [2018-04-11 17:26:52,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 17:26:52,827 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,839 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:52,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:52,855 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:301, output treesize:159 [2018-04-11 17:26:53,018 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:53,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:53,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:53,020 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 155 treesize of output 137 [2018-04-11 17:26:53,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:53,026 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 76 [2018-04-11 17:26:53,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:53,052 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:53,053 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 99 treesize of output 71 [2018-04-11 17:26:53,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:53,056 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:53,060 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 2 case distinctions, treesize of input 105 treesize of output 89 [2018-04-11 17:26:53,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:53,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:53,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-04-11 17:26:53,124 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 5 [2018-04-11 17:26:53,124 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:53,137 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:53,137 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-04-11 17:26:53,138 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:53,147 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:53,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2018-04-11 17:26:53,151 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:53,151 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 17 treesize of output 13 [2018-04-11 17:26:53,151 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:53,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 9 treesize of output 1 [2018-04-11 17:26:53,161 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:53,168 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:53,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:53,190 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:180, output treesize:73 [2018-04-11 17:26:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:53,278 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:53,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 17:26:53,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 17:26:53,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 17:26:53,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:26:53,279 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 24 states. [2018-04-11 17:26:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:55,476 INFO L93 Difference]: Finished difference Result 258 states and 276 transitions. [2018-04-11 17:26:55,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 17:26:55,476 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2018-04-11 17:26:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:55,477 INFO L225 Difference]: With dead ends: 258 [2018-04-11 17:26:55,477 INFO L226 Difference]: Without dead ends: 258 [2018-04-11 17:26:55,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=1632, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 17:26:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-04-11 17:26:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 189. [2018-04-11 17:26:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-11 17:26:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 202 transitions. [2018-04-11 17:26:55,480 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 202 transitions. Word has length 69 [2018-04-11 17:26:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:55,480 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 202 transitions. [2018-04-11 17:26:55,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 17:26:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 202 transitions. [2018-04-11 17:26:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 17:26:55,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:55,481 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:55,481 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash -842708615, now seen corresponding path program 1 times [2018-04-11 17:26:55,481 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:55,481 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:55,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:55,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:55,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:55,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:55,493 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:55,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:55,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:55,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:55,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:55,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:55,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:55,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:26:55,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 17:26:55,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:55,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:55,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 10 treesize of output 9 [2018-04-11 17:26:55,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:55,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:55,602 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,608 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:47, output treesize:26 [2018-04-11 17:26:55,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-11 17:26:55,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-11 17:26:55,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2018-04-11 17:26:55,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 17:26:55,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:55,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:55,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:7 [2018-04-11 17:26:55,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 17:26:55,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:55,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:55,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:55,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:55,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 17:26:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 17:26:55,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:55,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 17:26:55,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 17:26:55,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 17:26:55,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-04-11 17:26:55,757 INFO L87 Difference]: Start difference. First operand 189 states and 202 transitions. Second operand 19 states. [2018-04-11 17:26:56,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:56,153 INFO L93 Difference]: Finished difference Result 221 states and 233 transitions. [2018-04-11 17:26:56,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 17:26:56,153 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-04-11 17:26:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:56,153 INFO L225 Difference]: With dead ends: 221 [2018-04-11 17:26:56,154 INFO L226 Difference]: Without dead ends: 221 [2018-04-11 17:26:56,154 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=1047, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 17:26:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-11 17:26:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 188. [2018-04-11 17:26:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 17:26:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 201 transitions. [2018-04-11 17:26:56,156 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 201 transitions. Word has length 73 [2018-04-11 17:26:56,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:56,157 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 201 transitions. [2018-04-11 17:26:56,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 17:26:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 201 transitions. [2018-04-11 17:26:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 17:26:56,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:56,158 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:26:56,158 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:26:56,158 INFO L82 PathProgramCache]: Analyzing trace with hash -197663311, now seen corresponding path program 2 times [2018-04-11 17:26:56,158 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:56,158 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:56,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:56,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:56,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:56,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:56,169 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:56,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:56,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:56,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:26:56,203 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:26:56,203 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:56,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:56,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:56,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:56,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:56,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:56,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:26:56,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 17:26:56,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:56,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:56,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2018-04-11 17:26:56,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:56,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:56,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:56,348 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 22 treesize of output 32 [2018-04-11 17:26:56,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:56,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-04-11 17:26:56,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:56,379 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 43 treesize of output 44 [2018-04-11 17:26:56,381 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 10 treesize of output 9 [2018-04-11 17:26:56,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:56,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:51 [2018-04-11 17:26:56,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:56,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:56,448 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 42 [2018-04-11 17:26:56,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:56,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:92, output treesize:96 [2018-04-11 17:26:56,496 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 107 treesize of output 86 [2018-04-11 17:26:56,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21 [2018-04-11 17:26:56,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:56,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:118, output treesize:81 [2018-04-11 17:26:56,620 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 79 treesize of output 60 [2018-04-11 17:26:56,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-11 17:26:56,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:56,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2018-04-11 17:26:56,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:56,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:56,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:56,651 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:90, output treesize:48 [2018-04-11 17:26:56,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:56,736 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 2 case distinctions, treesize of input 17 treesize of output 34 [2018-04-11 17:26:56,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:56,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:56,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2018-04-11 17:26:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 17:26:56,818 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:56,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 17:26:56,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 17:26:56,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 17:26:56,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-04-11 17:26:56,819 INFO L87 Difference]: Start difference. First operand 188 states and 201 transitions. Second operand 24 states. [2018-04-11 17:27:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:05,056 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-04-11 17:27:05,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 17:27:05,056 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-04-11 17:27:05,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:05,057 INFO L225 Difference]: With dead ends: 249 [2018-04-11 17:27:05,057 INFO L226 Difference]: Without dead ends: 249 [2018-04-11 17:27:05,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=262, Invalid=1544, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 17:27:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-11 17:27:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 219. [2018-04-11 17:27:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 17:27:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 243 transitions. [2018-04-11 17:27:05,059 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 243 transitions. Word has length 73 [2018-04-11 17:27:05,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:05,060 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 243 transitions. [2018-04-11 17:27:05,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 17:27:05,060 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 243 transitions. [2018-04-11 17:27:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 17:27:05,060 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:05,060 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:27:05,060 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:05,060 INFO L82 PathProgramCache]: Analyzing trace with hash -197663310, now seen corresponding path program 2 times [2018-04-11 17:27:05,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:05,060 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:05,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:05,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:05,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:05,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:05,073 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:05,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:05,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:05,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:27:05,099 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:27:05,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:05,101 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:05,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:05,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:27:05,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:05,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:27:05,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 17:27:05,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:05,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:05,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:05,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:05,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:48 [2018-04-11 17:27:05,281 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 14 [2018-04-11 17:27:05,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 14 treesize of output 13 [2018-04-11 17:27:05,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:05,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:75 [2018-04-11 17:27:05,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,317 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 16 treesize of output 13 [2018-04-11 17:27:05,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,332 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 18 treesize of output 27 [2018-04-11 17:27:05,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:05,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:78 [2018-04-11 17:27:05,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-04-11 17:27:05,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2018-04-11 17:27:05,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 17:27:05,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,437 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 23 treesize of output 30 [2018-04-11 17:27:05,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:27:05,439 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,443 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:05,457 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:116, output treesize:72 [2018-04-11 17:27:05,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 44 [2018-04-11 17:27:05,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 17:27:05,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:05,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:121 [2018-04-11 17:27:05,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,588 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 17 treesize of output 10 [2018-04-11 17:27:05,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:05,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:126, output treesize:120 [2018-04-11 17:27:05,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,685 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 123 [2018-04-11 17:27:05,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:05,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,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 23 treesize of output 36 [2018-04-11 17:27:05,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 22 treesize of output 21 [2018-04-11 17:27:05,738 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:05,760 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:146, output treesize:126 [2018-04-11 17:27:05,909 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 3 case distinctions, treesize of input 80 treesize of output 184 [2018-04-11 17:27:05,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:05,917 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 128 treesize of output 151 [2018-04-11 17:27:05,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:05,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-11 17:27:05,948 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:05,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:27:05,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:05,985 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:170, output treesize:311 [2018-04-11 17:27:06,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:06,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:06,151 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 132 [2018-04-11 17:27:06,156 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:06,161 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2018-04-11 17:27:06,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:06,185 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 46 treesize of output 35 [2018-04-11 17:27:06,185 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:06,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-04-11 17:27:06,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:06,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:06,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 64 treesize of output 60 [2018-04-11 17:27:06,244 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:06,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-11 17:27:06,244 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:06,254 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:06,282 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 166 treesize of output 162 [2018-04-11 17:27:06,284 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:06,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-11 17:27:06,285 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:06,302 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:06,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:06,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:06,331 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 121 [2018-04-11 17:27:06,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:06,338 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2018-04-11 17:27:06,339 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:06,358 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 47 treesize of output 35 [2018-04-11 17:27:06,359 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:06,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-11 17:27:06,373 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:06,384 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:06,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:06,408 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:347, output treesize:68 [2018-04-11 17:27:06,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 17:27:06,506 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:06,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:27:06,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:06,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:27:06,510 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:06,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:06,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:06,515 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:38, output treesize:3 [2018-04-11 17:27:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 17:27:06,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:06,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 17:27:06,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 17:27:06,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 17:27:06,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2018-04-11 17:27:06,565 INFO L87 Difference]: Start difference. First operand 219 states and 243 transitions. Second operand 28 states. [2018-04-11 17:27:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:09,220 INFO L93 Difference]: Finished difference Result 254 states and 272 transitions. [2018-04-11 17:27:09,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 17:27:09,220 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-04-11 17:27:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:09,221 INFO L225 Difference]: With dead ends: 254 [2018-04-11 17:27:09,221 INFO L226 Difference]: Without dead ends: 254 [2018-04-11 17:27:09,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=322, Invalid=2434, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 17:27:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-11 17:27:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 219. [2018-04-11 17:27:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 17:27:09,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 242 transitions. [2018-04-11 17:27:09,223 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 242 transitions. Word has length 73 [2018-04-11 17:27:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:09,223 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 242 transitions. [2018-04-11 17:27:09,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 17:27:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 242 transitions. [2018-04-11 17:27:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 17:27:09,224 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:09,224 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2018-04-11 17:27:09,224 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:09,224 INFO L82 PathProgramCache]: Analyzing trace with hash -312476171, now seen corresponding path program 3 times [2018-04-11 17:27:09,224 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:09,224 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:09,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:09,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:09,225 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:09,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:09,233 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:09,233 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:09,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:09,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:27:09,252 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-11 17:27:09,253 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:09,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:09,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:09,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:27:09,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:27:09,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 17:27:09,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:09,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:09,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 17:27:09,332 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:27:09,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2018-04-11 17:27:09,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 17:27:09,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:09,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:46 [2018-04-11 17:27:09,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,420 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 45 treesize of output 107 [2018-04-11 17:27:09,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:09,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:86, output treesize:110 [2018-04-11 17:27:09,483 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,493 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 104 [2018-04-11 17:27:09,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 119 [2018-04-11 17:27:09,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,530 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 2 case distinctions, treesize of input 56 treesize of output 61 [2018-04-11 17:27:09,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:09,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:27:09,568 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 2 xjuncts. [2018-04-11 17:27:09,568 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:202 [2018-04-11 17:27:09,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 144 [2018-04-11 17:27:09,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:09,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 263 [2018-04-11 17:27:09,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:09,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:308, output treesize:378 [2018-04-11 17:27:09,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 177 [2018-04-11 17:27:09,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, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 17:27:09,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,984 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 121 [2018-04-11 17:27:09,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 22 treesize of output 21 [2018-04-11 17:27:09,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:09,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:10,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:10,032 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:468, output treesize:534 [2018-04-11 17:27:10,117 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 193 treesize of output 102 [2018-04-11 17:27:10,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-04-11 17:27:10,119 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:10,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2018-04-11 17:27:10,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:10,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 18 [2018-04-11 17:27:10,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:10,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:10,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:10,157 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:198, output treesize:45 [2018-04-11 17:27:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:27:10,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:10,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 17:27:10,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 17:27:10,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 17:27:10,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2018-04-11 17:27:10,244 INFO L87 Difference]: Start difference. First operand 219 states and 242 transitions. Second operand 26 states. [2018-04-11 17:27:12,259 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 91 DAG size of output 91 [2018-04-11 17:27:12,452 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 114 DAG size of output 114 [2018-04-11 17:27:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:13,396 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2018-04-11 17:27:13,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 17:27:13,396 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-04-11 17:27:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:13,397 INFO L225 Difference]: With dead ends: 299 [2018-04-11 17:27:13,397 INFO L226 Difference]: Without dead ends: 299 [2018-04-11 17:27:13,397 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=326, Invalid=2326, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 17:27:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-11 17:27:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 243. [2018-04-11 17:27:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-11 17:27:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 269 transitions. [2018-04-11 17:27:13,400 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 269 transitions. Word has length 73 [2018-04-11 17:27:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:13,400 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 269 transitions. [2018-04-11 17:27:13,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 17:27:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 269 transitions. [2018-04-11 17:27:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 17:27:13,400 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:13,400 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2018-04-11 17:27:13,400 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash -312476170, now seen corresponding path program 3 times [2018-04-11 17:27:13,401 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:13,401 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:13,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:13,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:13,401 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:13,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:13,415 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:13,415 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:13,415 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:13,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:27:13,448 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-11 17:27:13,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:13,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:13,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:13,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:27:13,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:13,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:27:13,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 17:27:13,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:13,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:13,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:13,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:13,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 17:27:13,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 17:27:13,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 17:27:13,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:77 [2018-04-11 17:27:13,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,717 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 23 treesize of output 30 [2018-04-11 17:27:13,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:27:13,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,742 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 71 [2018-04-11 17:27:13,744 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 10 treesize of output 9 [2018-04-11 17:27:13,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,766 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:103, output treesize:101 [2018-04-11 17:27:13,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-04-11 17:27:13,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:13,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 129 [2018-04-11 17:27:13,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:13,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:13,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:157, output treesize:180 [2018-04-11 17:27:14,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 143 [2018-04-11 17:27:14,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-11 17:27:14,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,072 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 23 treesize of output 36 [2018-04-11 17:27:14,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21 [2018-04-11 17:27:14,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:14,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:203, output treesize:228 [2018-04-11 17:27:14,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 189 [2018-04-11 17:27:14,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 258 [2018-04-11 17:27:14,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:14,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:332, output treesize:377 [2018-04-11 17:27:14,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 185 [2018-04-11 17:27:14,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 387 treesize of output 243 [2018-04-11 17:27:14,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-11 17:27:14,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 194 [2018-04-11 17:27:14,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-11 17:27:14,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:14,604 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:469, output treesize:484 [2018-04-11 17:27:14,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:14,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 481 treesize of output 229 [2018-04-11 17:27:14,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 44 [2018-04-11 17:27:14,731 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:14,752 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 150 treesize of output 106 [2018-04-11 17:27:14,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:14,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 32 [2018-04-11 17:27:14,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 22 [2018-04-11 17:27:14,789 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:14,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:14,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 17:27:14,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:27:14,826 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 17:27:14,830 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,831 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:14,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:14,847 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:505, output treesize:48 [2018-04-11 17:27:14,946 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:27:14,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:14,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 17:27:14,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 17:27:14,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 17:27:14,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2018-04-11 17:27:14,946 INFO L87 Difference]: Start difference. First operand 243 states and 269 transitions. Second operand 28 states. [2018-04-11 17:27:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:16,987 INFO L93 Difference]: Finished difference Result 325 states and 355 transitions. [2018-04-11 17:27:16,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 17:27:16,988 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-04-11 17:27:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:16,989 INFO L225 Difference]: With dead ends: 325 [2018-04-11 17:27:16,989 INFO L226 Difference]: Without dead ends: 325 [2018-04-11 17:27:16,989 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=370, Invalid=2710, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 17:27:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-04-11 17:27:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 248. [2018-04-11 17:27:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-11 17:27:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 274 transitions. [2018-04-11 17:27:16,992 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 274 transitions. Word has length 73 [2018-04-11 17:27:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:16,992 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 274 transitions. [2018-04-11 17:27:16,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 17:27:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 274 transitions. [2018-04-11 17:27:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 17:27:16,993 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:16,993 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-04-11 17:27:16,993 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:16,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1860960715, now seen corresponding path program 1 times [2018-04-11 17:27:16,993 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:16,993 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:16,994 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:16,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:16,994 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:17,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:17,006 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:17,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:17,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:17,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:27:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:17,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:17,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:17,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:17,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:27:17,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 17:27:17,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:17,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:17,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:17,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:17,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,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-04-11 17:27:17,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2018-04-11 17:27:17,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:27:17,136 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 11 treesize of output 7 [2018-04-11 17:27:17,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:33 [2018-04-11 17:27:17,162 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 12 [2018-04-11 17:27:17,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:27:17,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:47 [2018-04-11 17:27:17,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:17,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:17,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:17,189 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-04-11 17:27:17,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:45 [2018-04-11 17:27:17,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:17,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:17,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 60 [2018-04-11 17:27:17,226 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 22 treesize of output 18 [2018-04-11 17:27:17,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:49 [2018-04-11 17:27:17,285 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 43 treesize of output 48 [2018-04-11 17:27:17,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 17 [2018-04-11 17:27:17,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:17,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:67 [2018-04-11 17:27:17,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:17,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:17,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, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 61 [2018-04-11 17:27:17,398 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 54 [2018-04-11 17:27:17,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 8 xjuncts. [2018-04-11 17:27:17,432 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 45 treesize of output 33 [2018-04-11 17:27:17,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:17,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:17,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-04-11 17:27:17,436 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:17,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 53 [2018-04-11 17:27:17,441 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:17,442 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 27 [2018-04-11 17:27:17,443 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:17,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-04-11 17:27:17,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 19 dim-0 vars, and 5 xjuncts. [2018-04-11 17:27:17,544 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:82, output treesize:153 [2018-04-11 17:27:17,667 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-04-11 17:27:17,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:27:17,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:17,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:27:17,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:17,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:27:17,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:27:17,683 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:21 [2018-04-11 17:27:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 17:27:17,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:17,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 17:27:17,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 17:27:17,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 17:27:17,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-04-11 17:27:17,758 INFO L87 Difference]: Start difference. First operand 248 states and 274 transitions. Second operand 26 states. [2018-04-11 17:27:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:18,887 INFO L93 Difference]: Finished difference Result 277 states and 301 transitions. [2018-04-11 17:27:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 17:27:18,888 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-04-11 17:27:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:18,889 INFO L225 Difference]: With dead ends: 277 [2018-04-11 17:27:18,889 INFO L226 Difference]: Without dead ends: 276 [2018-04-11 17:27:18,889 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=2129, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 17:27:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-04-11 17:27:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 245. [2018-04-11 17:27:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-11 17:27:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 270 transitions. [2018-04-11 17:27:18,891 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 270 transitions. Word has length 75 [2018-04-11 17:27:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:18,891 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 270 transitions. [2018-04-11 17:27:18,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 17:27:18,891 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 270 transitions. [2018-04-11 17:27:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 17:27:18,891 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:18,892 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:27:18,892 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:18,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1198012571, now seen corresponding path program 3 times [2018-04-11 17:27:18,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:18,892 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:18,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:18,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:27:18,892 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:18,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:18,903 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:18,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:18,903 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:18,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:27:18,936 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-11 17:27:18,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:18,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:18,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:18,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:18,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:18,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:27:18,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:27:18,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:27:18,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:18,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:18,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:18,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-04-11 17:27:18,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:18,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:18,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 17:27:18,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:18,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:18,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 17:27:19,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:19,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:19,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-04-11 17:27:19,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,060 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 26 [2018-04-11 17:27:19,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 17:27:19,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:45 [2018-04-11 17:27:19,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:27:19,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:54 [2018-04-11 17:27:19,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,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, 2 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-04-11 17:27:19,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:19,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:66 [2018-04-11 17:27:19,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 106 [2018-04-11 17:27:19,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-04-11 17:27:19,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 71 [2018-04-11 17:27:19,262 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:19,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:27:19,296 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-04-11 17:27:19,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:100, output treesize:191 [2018-04-11 17:27:19,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,373 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 102 treesize of output 138 [2018-04-11 17:27:19,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,416 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 94 treesize of output 130 [2018-04-11 17:27:19,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,446 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-04-11 17:27:19,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:197, output treesize:225 [2018-04-11 17:27:19,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,576 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 129 treesize of output 124 [2018-04-11 17:27:19,579 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 140 treesize of output 139 [2018-04-11 17:27:19,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,680 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:19,681 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,683 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 121 treesize of output 107 [2018-04-11 17:27:19,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-04-11 17:27:19,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,722 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 2 xjuncts. [2018-04-11 17:27:19,723 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:251, output treesize:222 [2018-04-11 17:27:19,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,891 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 151 [2018-04-11 17:27:19,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 17:27:19,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:19,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:19,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 199 treesize of output 297 [2018-04-11 17:27:19,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 261 [2018-04-11 17:27:19,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:20,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:20,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:20,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:328, output treesize:338 [2018-04-11 17:27:20,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,137 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 218 treesize of output 210 [2018-04-11 17:27:20,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:20,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,171 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 129 treesize of output 143 [2018-04-11 17:27:20,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:20,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:20,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:348, output treesize:332 [2018-04-11 17:27:20,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 120 [2018-04-11 17:27:20,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-11 17:27:20,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:20,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:20,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 223 treesize of output 173 [2018-04-11 17:27:20,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 145 [2018-04-11 17:27:20,405 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:20,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 219 [2018-04-11 17:27:20,497 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:20,548 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:20,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-11 17:27:20,613 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:358, output treesize:474 [2018-04-11 17:27:20,703 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 111 [2018-04-11 17:27:20,705 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 44 treesize of output 28 [2018-04-11 17:27:20,705 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:20,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-11 17:27:20,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:20,727 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 36 treesize of output 20 [2018-04-11 17:27:20,727 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:20,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:20,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:20,775 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 136 treesize of output 107 [2018-04-11 17:27:20,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-11 17:27:20,776 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:20,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-04-11 17:27:20,786 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:20,794 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 36 treesize of output 20 [2018-04-11 17:27:20,794 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:20,801 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:20,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 288 treesize of output 153 [2018-04-11 17:27:20,850 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 128 treesize of output 116 [2018-04-11 17:27:20,851 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:20,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 120 [2018-04-11 17:27:20,921 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:20,986 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 101 [2018-04-11 17:27:20,987 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:21,051 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 116 treesize of output 100 [2018-04-11 17:27:21,052 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:21,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 81 [2018-04-11 17:27:21,114 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:21,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 69 [2018-04-11 17:27:21,179 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:21,241 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 81 treesize of output 65 [2018-04-11 17:27:21,241 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:21,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 108 [2018-04-11 17:27:21,314 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:21,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2018-04-11 17:27:21,376 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:21,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 81 [2018-04-11 17:27:21,445 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:21,519 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 116 treesize of output 97 [2018-04-11 17:27:21,520 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:21,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2018-04-11 17:27:21,589 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:21,650 INFO L267 ElimStorePlain]: Start of recursive call 10: 12 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-04-11 17:27:21,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: 32 dim-0 vars, and 6 xjuncts. [2018-04-11 17:27:21,735 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 11 variables, input treesize:618, output treesize:377 [2018-04-11 17:27:21,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 54 [2018-04-11 17:27:21,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:27:21,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:21,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:21,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:21,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:57, output treesize:53 [2018-04-11 17:27:22,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-04-11 17:27:22,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:27:22,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:22,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:27:22,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:22,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:27:22,099 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:22,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:27:22,103 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:22,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:22,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:22,110 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:63, output treesize:7 [2018-04-11 17:27:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:27:22,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:22,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 17:27:22,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 17:27:22,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 17:27:22,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1023, Unknown=1, NotChecked=0, Total=1122 [2018-04-11 17:27:22,179 INFO L87 Difference]: Start difference. First operand 245 states and 270 transitions. Second operand 34 states. [2018-04-11 17:27:23,883 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 112 DAG size of output 112 [2018-04-11 17:27:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:25,058 INFO L93 Difference]: Finished difference Result 318 states and 347 transitions. [2018-04-11 17:27:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 17:27:25,059 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-04-11 17:27:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:25,060 INFO L225 Difference]: With dead ends: 318 [2018-04-11 17:27:25,060 INFO L226 Difference]: Without dead ends: 314 [2018-04-11 17:27:25,060 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=399, Invalid=3888, Unknown=3, NotChecked=0, Total=4290 [2018-04-11 17:27:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-11 17:27:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-04-11 17:27:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-11 17:27:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 269 transitions. [2018-04-11 17:27:25,062 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 269 transitions. Word has length 75 [2018-04-11 17:27:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:25,063 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 269 transitions. [2018-04-11 17:27:25,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 17:27:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 269 transitions. [2018-04-11 17:27:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 17:27:25,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:25,063 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:27:25,063 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:25,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1860844830, now seen corresponding path program 1 times [2018-04-11 17:27:25,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:25,064 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:25,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:25,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:25,064 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:25,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:25,072 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:25,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:25,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:25,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:27:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:25,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:25,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 6 treesize of output 5 [2018-04-11 17:27:25,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:27:25,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:27:25,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 17:27:25,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:25,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:25,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:25,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:25,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 17:27:25,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-11 17:27:25,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:79 [2018-04-11 17:27:25,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,353 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 32 treesize of output 39 [2018-04-11 17:27:25,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:27:25,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,383 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 69 treesize of output 81 [2018-04-11 17:27:25,395 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 22 treesize of output 18 [2018-04-11 17:27:25,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,418 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:105, output treesize:87 [2018-04-11 17:27:25,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 17:27:25,537 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:25,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 17:27:25,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:25,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:71 [2018-04-11 17:27:25,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,773 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 36 treesize of output 86 [2018-04-11 17:27:25,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:25,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:89, output treesize:69 [2018-04-11 17:27:25,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,889 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:25,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,890 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-04-11 17:27:25,904 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 50 [2018-04-11 17:27:25,905 INFO L267 ElimStorePlain]: Start of recursive call 3: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 8 xjuncts. [2018-04-11 17:27:25,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:25,945 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:25,946 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 46 treesize of output 48 [2018-04-11 17:27:25,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,948 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:25,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 17:27:25,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,950 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:25,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-11 17:27:25,950 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:25,953 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:25,957 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 2 case distinctions, treesize of input 46 treesize of output 48 [2018-04-11 17:27:25,958 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:25,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 17:27:26,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-04-11 17:27:26,014 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:84, output treesize:102 [2018-04-11 17:27:26,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:26,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:26,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:26,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 36 [2018-04-11 17:27:26,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:26,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:26,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-04-11 17:27:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-11 17:27:26,198 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:26,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 17:27:26,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 17:27:26,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 17:27:26,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 17:27:26,199 INFO L87 Difference]: Start difference. First operand 245 states and 269 transitions. Second operand 34 states. [2018-04-11 17:27:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:27,841 INFO L93 Difference]: Finished difference Result 269 states and 294 transitions. [2018-04-11 17:27:27,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 17:27:27,842 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 77 [2018-04-11 17:27:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:27,842 INFO L225 Difference]: With dead ends: 269 [2018-04-11 17:27:27,842 INFO L226 Difference]: Without dead ends: 269 [2018-04-11 17:27:27,843 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=361, Invalid=2719, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 17:27:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-11 17:27:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 245. [2018-04-11 17:27:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-11 17:27:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 269 transitions. [2018-04-11 17:27:27,844 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 269 transitions. Word has length 77 [2018-04-11 17:27:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:27,844 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 269 transitions. [2018-04-11 17:27:27,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 17:27:27,845 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 269 transitions. [2018-04-11 17:27:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 17:27:27,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:27,845 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:27:27,845 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1860844831, now seen corresponding path program 2 times [2018-04-11 17:27:27,845 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:27,845 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:27,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:27,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:27:27,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:27,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:27,913 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:27,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:27,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:27,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:27:27,947 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:27:27,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:27,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:27,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:27,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:27,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:27,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:27:28,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:28,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:28,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:27:28,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-11 17:27:28,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:28,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:28,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:28,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:28,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-11 17:27:28,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:28,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:49 [2018-04-11 17:27:28,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:28,177 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 32 treesize of output 39 [2018-04-11 17:27:28,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:27:28,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:28,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-04-11 17:27:28,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:28,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:67 [2018-04-11 17:27:28,527 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 88 treesize of output 73 [2018-04-11 17:27:28,529 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 40 [2018-04-11 17:27:28,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:28,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2018-04-11 17:27:28,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:28,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:28,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-04-11 17:27:28,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2018-04-11 17:27:28,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 17:27:28,592 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:28,599 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:27:28,600 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 64 treesize of output 50 [2018-04-11 17:27:28,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:28,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-04-11 17:27:28,603 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 6 [2018-04-11 17:27:28,608 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,612 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:28,627 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 3 xjuncts. [2018-04-11 17:27:28,628 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:101, output treesize:40 [2018-04-11 17:27:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 17:27:28,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:28,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 17:27:28,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 17:27:28,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 17:27:28,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-04-11 17:27:28,776 INFO L87 Difference]: Start difference. First operand 245 states and 269 transitions. Second operand 27 states. [2018-04-11 17:27:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:30,342 INFO L93 Difference]: Finished difference Result 288 states and 312 transitions. [2018-04-11 17:27:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 17:27:30,343 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 77 [2018-04-11 17:27:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:30,343 INFO L225 Difference]: With dead ends: 288 [2018-04-11 17:27:30,343 INFO L226 Difference]: Without dead ends: 288 [2018-04-11 17:27:30,344 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=302, Invalid=2350, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 17:27:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-04-11 17:27:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 257. [2018-04-11 17:27:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-11 17:27:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2018-04-11 17:27:30,345 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 77 [2018-04-11 17:27:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:30,346 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2018-04-11 17:27:30,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 17:27:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2018-04-11 17:27:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 17:27:30,346 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:30,346 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:27:30,346 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash -626147759, now seen corresponding path program 4 times [2018-04-11 17:27:30,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:30,346 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:30,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:30,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:30,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:30,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:30,370 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:30,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:30,371 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:30,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 17:27:30,395 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 17:27:30,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:30,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:30,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:30,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:27:30,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:27:30,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 17:27:30,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:30,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:30,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:30,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:30,468 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 17:27:30,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:30,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 17:27:30,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:63 [2018-04-11 17:27:30,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,612 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 43 treesize of output 55 [2018-04-11 17:27:30,614 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 22 treesize of output 18 [2018-04-11 17:27:30,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,634 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 32 treesize of output 39 [2018-04-11 17:27:30,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:27:30,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:83 [2018-04-11 17:27:30,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,738 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 30 treesize of output 51 [2018-04-11 17:27:30,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,759 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 57 [2018-04-11 17:27:30,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:171, output treesize:186 [2018-04-11 17:27:30,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,845 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 173 treesize of output 192 [2018-04-11 17:27:30,847 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 28 treesize of output 24 [2018-04-11 17:27:30,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:30,883 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 131 treesize of output 152 [2018-04-11 17:27:30,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:30,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:30,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:217, output treesize:158 [2018-04-11 17:27:31,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:31,028 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 218 treesize of output 176 [2018-04-11 17:27:31,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 75 [2018-04-11 17:27:31,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:31,039 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 135 treesize of output 100 [2018-04-11 17:27:31,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:31,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:31,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:31,053 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:225, output treesize:107 [2018-04-11 17:27:31,229 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:31,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2018-04-11 17:27:31,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:31,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:31,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:31,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:31,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:31,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:31,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 79 [2018-04-11 17:27:31,248 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-04-11 17:27:31,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:31,254 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-04-11 17:27:31,255 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:31,260 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:31,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-11 17:27:31,260 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:31,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:31,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:31,270 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:142, output treesize:15 [2018-04-11 17:27:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:27:31,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:31,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 17:27:31,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 17:27:31,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 17:27:31,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2018-04-11 17:27:31,344 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand 30 states. [2018-04-11 17:27:33,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:33,473 INFO L93 Difference]: Finished difference Result 273 states and 293 transitions. [2018-04-11 17:27:33,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 17:27:33,474 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 77 [2018-04-11 17:27:33,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:33,474 INFO L225 Difference]: With dead ends: 273 [2018-04-11 17:27:33,474 INFO L226 Difference]: Without dead ends: 273 [2018-04-11 17:27:33,475 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=441, Invalid=2981, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 17:27:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-11 17:27:33,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 260. [2018-04-11 17:27:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-11 17:27:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 286 transitions. [2018-04-11 17:27:33,476 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 286 transitions. Word has length 77 [2018-04-11 17:27:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:33,476 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 286 transitions. [2018-04-11 17:27:33,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 17:27:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 286 transitions. [2018-04-11 17:27:33,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 17:27:33,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:33,477 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:27:33,477 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:33,477 INFO L82 PathProgramCache]: Analyzing trace with hash -626147758, now seen corresponding path program 3 times [2018-04-11 17:27:33,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:33,477 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:33,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:33,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:33,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:33,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:33,519 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:33,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:33,519 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:33,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:27:33,540 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 17:27:33,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:33,542 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:33,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:33,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:27:33,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:33,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,678 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:33,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:33,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:27:33,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 17:27:33,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:33,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:33,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:33,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:33,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,766 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:48 [2018-04-11 17:27:33,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:33,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 17:27:33,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:33,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:33,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:33,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:33,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 17:27:33,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:33,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:89 [2018-04-11 17:27:33,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:33,936 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 55 treesize of output 56 [2018-04-11 17:27:33,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:33,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:33,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 17:27:33,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:27:33,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:33,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:33,987 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:125 [2018-04-11 17:27:34,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 138 [2018-04-11 17:27:34,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:34,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 95 [2018-04-11 17:27:34,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:34,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:34,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:209, output treesize:222 [2018-04-11 17:27:34,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,251 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 17:27:34,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:34,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 238 [2018-04-11 17:27:34,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 87 treesize of output 80 [2018-04-11 17:27:34,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:34,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:34,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,330 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 140 [2018-04-11 17:27:34,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 17:27:34,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:34,338 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:34,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:34,355 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:287, output treesize:266 [2018-04-11 17:27:34,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,754 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:34,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,755 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:34,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 282 [2018-04-11 17:27:34,765 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:34,779 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 130 [2018-04-11 17:27:34,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-04-11 17:27:34,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:34,909 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 2 case distinctions, treesize of input 149 treesize of output 121 [2018-04-11 17:27:34,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:34,912 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:34,916 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 2 case distinctions, treesize of input 143 treesize of output 115 [2018-04-11 17:27:34,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:34,919 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:34,923 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 2 case distinctions, treesize of input 159 treesize of output 131 [2018-04-11 17:27:34,924 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:34,925 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:34,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 97 [2018-04-11 17:27:34,926 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:34,927 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:34,927 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 137 treesize of output 91 [2018-04-11 17:27:34,927 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:34,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:34,931 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:34,932 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 159 treesize of output 133 [2018-04-11 17:27:34,932 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:34,935 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:34,939 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 2 case distinctions, treesize of input 153 treesize of output 125 [2018-04-11 17:27:34,940 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:35,127 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 125 treesize of output 93 [2018-04-11 17:27:35,127 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:35,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:35,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 113 [2018-04-11 17:27:35,130 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:35,132 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 125 treesize of output 93 [2018-04-11 17:27:35,132 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:35,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 111 [2018-04-11 17:27:35,138 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:35,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 113 [2018-04-11 17:27:35,144 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:35,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 107 [2018-04-11 17:27:35,149 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:35,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 107 [2018-04-11 17:27:35,155 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:35,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-04-11 17:27:35,713 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 102 treesize of output 90 [2018-04-11 17:27:35,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:27:35,714 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,729 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:35,729 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 19 treesize of output 15 [2018-04-11 17:27:35,729 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 17:27:35,742 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,751 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,754 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 102 treesize of output 94 [2018-04-11 17:27:35,756 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:35,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 19 treesize of output 15 [2018-04-11 17:27:35,756 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:27:35,771 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,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 19 treesize of output 3 [2018-04-11 17:27:35,784 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,794 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,796 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 102 treesize of output 90 [2018-04-11 17:27:35,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:27:35,799 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2018-04-11 17:27:35,820 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 17:27:35,835 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,846 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,849 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 102 treesize of output 94 [2018-04-11 17:27:35,851 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:35,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 17:27:35,852 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,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 7 treesize of output 1 [2018-04-11 17:27:35,869 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 17:27:35,882 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,891 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,894 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 102 treesize of output 90 [2018-04-11 17:27:35,896 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:35,896 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 19 treesize of output 15 [2018-04-11 17:27:35,896 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:27:35,911 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 17:27:35,923 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,933 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,936 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 102 treesize of output 90 [2018-04-11 17:27:35,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:27:35,938 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,952 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:35,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 17:27:35,953 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 17:27:35,965 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,975 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,978 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 102 treesize of output 94 [2018-04-11 17:27:35,980 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:35,980 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 19 treesize of output 15 [2018-04-11 17:27:35,980 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:35,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:27:35,995 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 17:27:36,007 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,017 INFO L267 ElimStorePlain]: Start of recursive call 42: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,021 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 102 treesize of output 90 [2018-04-11 17:27:36,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:36,022 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 19 treesize of output 15 [2018-04-11 17:27:36,023 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 17:27:36,037 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:27:36,048 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,057 INFO L267 ElimStorePlain]: Start of recursive call 46: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,059 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 102 treesize of output 94 [2018-04-11 17:27:36,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 7 treesize of output 1 [2018-04-11 17:27:36,061 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,076 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:36,076 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 19 treesize of output 15 [2018-04-11 17:27:36,076 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 17:27:36,088 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,097 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,100 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 102 treesize of output 90 [2018-04-11 17:27:36,101 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:36,102 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 19 treesize of output 15 [2018-04-11 17:27:36,102 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:27:36,117 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,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 19 treesize of output 3 [2018-04-11 17:27:36,130 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,141 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,144 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 102 treesize of output 90 [2018-04-11 17:27:36,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-11 17:27:36,146 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,161 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:36,162 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 19 treesize of output 15 [2018-04-11 17:27:36,162 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 17:27:36,175 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,185 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:36,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-04-11 17:27:36,348 INFO L202 ElimStorePlain]: Needed 61 recursive calls to eliminate 6 variables, input treesize:333, output treesize:397 [2018-04-11 17:27:36,502 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:27:36,503 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:36,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 17:27:36,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 17:27:36,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 17:27:36,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2018-04-11 17:27:36,503 INFO L87 Difference]: Start difference. First operand 260 states and 286 transitions. Second operand 28 states. [2018-04-11 17:27:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:39,522 INFO L93 Difference]: Finished difference Result 298 states and 319 transitions. [2018-04-11 17:27:39,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 17:27:39,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 77 [2018-04-11 17:27:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:39,523 INFO L225 Difference]: With dead ends: 298 [2018-04-11 17:27:39,523 INFO L226 Difference]: Without dead ends: 298 [2018-04-11 17:27:39,524 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=353, Invalid=2403, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 17:27:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-04-11 17:27:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 265. [2018-04-11 17:27:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-11 17:27:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 291 transitions. [2018-04-11 17:27:39,526 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 291 transitions. Word has length 77 [2018-04-11 17:27:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:39,526 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 291 transitions. [2018-04-11 17:27:39,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 17:27:39,526 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 291 transitions. [2018-04-11 17:27:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 17:27:39,526 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:39,527 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:27:39,527 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:39,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1196615647, now seen corresponding path program 2 times [2018-04-11 17:27:39,527 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:39,527 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:39,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:39,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:39,528 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:39,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:39,537 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:39,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:39,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:39,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:27:39,570 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:27:39,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:39,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:39,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:39,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:27:39,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:39,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:39,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:27:39,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:39,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-04-11 17:27:39,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:39,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:39,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:47 [2018-04-11 17:27:39,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:39,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:39,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:39,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 32 [2018-04-11 17:27:39,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,747 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 18 treesize of output 27 [2018-04-11 17:27:39,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:39,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:53 [2018-04-11 17:27:39,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-04-11 17:27:39,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:27:39,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:39,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:39,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:44 [2018-04-11 17:27:39,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:39,984 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:39,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 17:27:39,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:40,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:40,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:87, output treesize:51 [2018-04-11 17:27:40,288 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:40,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-04-11 17:27:40,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 17:27:40,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:40,302 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:40,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 32 [2018-04-11 17:27:40,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:40,303 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:40,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2018-04-11 17:27:40,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:40,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:40,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-11 17:27:40,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:40,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-11 17:27:40,329 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:40,332 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:40,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-04-11 17:27:40,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 17:27:40,338 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:40,343 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:40,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 17:27:40,359 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:84, output treesize:40 [2018-04-11 17:27:40,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:27:40,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:27:40,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:40,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:40,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:40,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-11 17:27:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:27:40,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:40,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 17:27:40,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 17:27:40,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 17:27:40,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=914, Unknown=0, NotChecked=0, Total=992 [2018-04-11 17:27:40,495 INFO L87 Difference]: Start difference. First operand 265 states and 291 transitions. Second operand 32 states. [2018-04-11 17:27:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:42,322 INFO L93 Difference]: Finished difference Result 275 states and 299 transitions. [2018-04-11 17:27:42,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 17:27:42,323 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-04-11 17:27:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:42,323 INFO L225 Difference]: With dead ends: 275 [2018-04-11 17:27:42,323 INFO L226 Difference]: Without dead ends: 275 [2018-04-11 17:27:42,324 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=375, Invalid=3407, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 17:27:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-11 17:27:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2018-04-11 17:27:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-04-11 17:27:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 286 transitions. [2018-04-11 17:27:42,325 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 286 transitions. Word has length 81 [2018-04-11 17:27:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:42,325 INFO L459 AbstractCegarLoop]: Abstraction has 261 states and 286 transitions. [2018-04-11 17:27:42,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 17:27:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 286 transitions. [2018-04-11 17:27:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 17:27:42,326 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:42,326 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-04-11 17:27:42,326 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash 783430219, now seen corresponding path program 3 times [2018-04-11 17:27:42,326 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:42,327 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:42,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:42,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:42,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:42,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:42,356 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:42,356 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:42,356 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:42,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:27:42,370 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 17:27:42,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:42,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:42,432 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 29 treesize of output 25 [2018-04-11 17:27:42,433 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:42,433 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 25 treesize of output 21 [2018-04-11 17:27:42,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,441 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 32 treesize of output 26 [2018-04-11 17:27:42,442 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:42,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 17:27:42,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:56, output treesize:11 [2018-04-11 17:27:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-04-11 17:27:42,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:42,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 17:27:42,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 17:27:42,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 17:27:42,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-04-11 17:27:42,469 INFO L87 Difference]: Start difference. First operand 261 states and 286 transitions. Second operand 13 states. [2018-04-11 17:27:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:42,822 INFO L93 Difference]: Finished difference Result 324 states and 348 transitions. [2018-04-11 17:27:42,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 17:27:42,823 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-04-11 17:27:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:42,823 INFO L225 Difference]: With dead ends: 324 [2018-04-11 17:27:42,823 INFO L226 Difference]: Without dead ends: 324 [2018-04-11 17:27:42,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2018-04-11 17:27:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-04-11 17:27:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 278. [2018-04-11 17:27:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-04-11 17:27:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 307 transitions. [2018-04-11 17:27:42,825 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 307 transitions. Word has length 81 [2018-04-11 17:27:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:42,826 INFO L459 AbstractCegarLoop]: Abstraction has 278 states and 307 transitions. [2018-04-11 17:27:42,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 17:27:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 307 transitions. [2018-04-11 17:27:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 17:27:42,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:42,826 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-04-11 17:27:42,826 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:42,827 INFO L82 PathProgramCache]: Analyzing trace with hash 262790158, now seen corresponding path program 5 times [2018-04-11 17:27:42,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:42,827 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:42,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:42,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:42,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:42,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:42,840 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:42,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:42,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:42,841 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 17:27:42,885 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-04-11 17:27:42,885 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:42,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27:42,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:42,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:27:42,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 6 treesize of output 5 [2018-04-11 17:27:42,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:42,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:42,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:27:42,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 17:27:42,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:42,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:42,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:42,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:42,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:42,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2018-04-11 17:27:43,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 17:27:43,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 46 [2018-04-11 17:27:43,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:80 [2018-04-11 17:27:43,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-04-11 17:27:43,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:27:43,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,136 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 71 [2018-04-11 17:27:43,137 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 10 treesize of output 9 [2018-04-11 17:27:43,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:104 [2018-04-11 17:27:43,189 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 42 treesize of output 26 [2018-04-11 17:27:43,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:43,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:153, output treesize:105 [2018-04-11 17:27:43,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 79 [2018-04-11 17:27:43,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:43,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:110, output treesize:102 [2018-04-11 17:27:43,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,323 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 23 treesize of output 36 [2018-04-11 17:27:43,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 17:27:43,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,349 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 114 treesize of output 122 [2018-04-11 17:27:43,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-04-11 17:27:43,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:43,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:133, output treesize:113 [2018-04-11 17:27:43,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,452 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 29 treesize of output 57 [2018-04-11 17:27:43,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:43,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:190, output treesize:200 [2018-04-11 17:27:43,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 170 [2018-04-11 17:27:43,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 17:27:43,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,549 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 59 treesize of output 60 [2018-04-11 17:27:43,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 28 treesize of output 27 [2018-04-11 17:27:43,551 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:43,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:277, output treesize:179 [2018-04-11 17:27:43,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:27:43,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:27:43,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:43,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:168, output treesize:157 [2018-04-11 17:27:43,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:43,755 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 95 [2018-04-11 17:27:43,757 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:43,761 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 51 [2018-04-11 17:27:43,761 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:43,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2018-04-11 17:27:43,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,780 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-04-11 17:27:43,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:43,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:43,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:166, output treesize:15 [2018-04-11 17:27:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:27:43,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:43,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 17:27:43,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 17:27:43,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 17:27:43,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=730, Unknown=1, NotChecked=0, Total=812 [2018-04-11 17:27:43,874 INFO L87 Difference]: Start difference. First operand 278 states and 307 transitions. Second operand 29 states. [2018-04-11 17:27:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:27:54,601 INFO L93 Difference]: Finished difference Result 338 states and 372 transitions. [2018-04-11 17:27:54,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 17:27:54,601 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 81 [2018-04-11 17:27:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:27:54,602 INFO L225 Difference]: With dead ends: 338 [2018-04-11 17:27:54,602 INFO L226 Difference]: Without dead ends: 338 [2018-04-11 17:27:54,602 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=407, Invalid=2784, Unknown=1, NotChecked=0, Total=3192 [2018-04-11 17:27:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-11 17:27:54,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 281. [2018-04-11 17:27:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-11 17:27:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 311 transitions. [2018-04-11 17:27:54,605 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 311 transitions. Word has length 81 [2018-04-11 17:27:54,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:27:54,606 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 311 transitions. [2018-04-11 17:27:54,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 17:27:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 311 transitions. [2018-04-11 17:27:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 17:27:54,606 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:27:54,606 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2018-04-11 17:27:54,606 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:27:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash 262790159, now seen corresponding path program 4 times [2018-04-11 17:27:54,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:27:54,607 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:27:54,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:54,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:27:54,607 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:27:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:27:54,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:27:54,628 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:27:54,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:27:54,629 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:27:54,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 17:27:54,677 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 17:27:54,677 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:27:54,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:27: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 6 treesize of output 5 [2018-04-11 17:27:54,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:27:54,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:27:54,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:54,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:54,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 17:27:54,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-11 17:27:54,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:54,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 10 treesize of output 9 [2018-04-11 17:27:54,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:27:54,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:54,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,828 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:59 [2018-04-11 17:27:54,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:54,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 17:27:54,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:54,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:54,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:54,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 61 [2018-04-11 17:27:54,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:54,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:54,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:94, output treesize:101 [2018-04-11 17:27:54,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:54,997 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 32 treesize of output 39 [2018-04-11 17:27:54,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:27:55,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,032 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 69 treesize of output 81 [2018-04-11 17:27:55,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 17:27:55,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:55,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:121 [2018-04-11 17:27:55,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,180 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 41 treesize of output 100 [2018-04-11 17:27:55,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,214 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 104 [2018-04-11 17:27:55,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:55,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:198, output treesize:189 [2018-04-11 17:27:55,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,297 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 160 treesize of output 181 [2018-04-11 17:27:55,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:27:55,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 202 [2018-04-11 17:27:55,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 39 treesize of output 32 [2018-04-11 17:27:55,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:55,384 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:227, output treesize:175 [2018-04-11 17:27:55,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 224 [2018-04-11 17:27:55,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 17:27:55,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:55,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:300, output treesize:293 [2018-04-11 17:27:55,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 284 [2018-04-11 17:27:55,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 17:27:55,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,646 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 332 treesize of output 318 [2018-04-11 17:27:55,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-04-11 17:27:55,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,663 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:55,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:55,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:388, output treesize:266 [2018-04-11 17:27:55,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,953 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:55,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:55,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 277 treesize of output 234 [2018-04-11 17:27:55,959 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:55,972 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 108 [2018-04-11 17:27:55,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-04-11 17:27:56,090 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,095 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 2 case distinctions, treesize of input 154 treesize of output 114 [2018-04-11 17:27:56,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:56,097 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 94 [2018-04-11 17:27:56,098 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,100 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,105 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 2 case distinctions, treesize of input 160 treesize of output 120 [2018-04-11 17:27:56,106 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:56,107 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 100 [2018-04-11 17:27:56,108 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,111 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,116 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 2 case distinctions, treesize of input 164 treesize of output 124 [2018-04-11 17:27:56,116 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:56,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:56,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:56,119 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 128 [2018-04-11 17:27:56,121 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,125 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,131 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 2 case distinctions, treesize of input 166 treesize of output 126 [2018-04-11 17:27:56,132 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 17:27:56,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 96 [2018-04-11 17:27:56,335 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:56,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 102 [2018-04-11 17:27:56,341 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:56,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 100 [2018-04-11 17:27:56,355 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:56,357 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 98 treesize of output 82 [2018-04-11 17:27:56,357 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:56,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 96 [2018-04-11 17:27:56,362 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:27:56,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 82 [2018-04-11 17:27:56,364 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:56,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:27:56,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2018-04-11 17:27:56,366 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:27:56,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-04-11 17:27:56,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:56,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 5 [2018-04-11 17:27:56,871 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,885 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,885 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-04-11 17:27:56,885 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,897 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:56,901 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 5 [2018-04-11 17:27:56,901 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,915 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,915 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-04-11 17:27:56,915 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,927 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:56,930 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 5 [2018-04-11 17:27:56,931 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,948 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-04-11 17:27:56,948 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,960 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:56,963 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 5 [2018-04-11 17:27:56,963 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,978 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:56,978 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-04-11 17:27:56,978 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,991 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:56,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:56,994 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 5 [2018-04-11 17:27:56,994 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,009 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:57,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-04-11 17:27:57,009 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,020 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:57,023 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 5 [2018-04-11 17:27:57,023 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,036 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:57,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-11 17:27:57,037 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,048 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:57,051 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 5 [2018-04-11 17:27:57,051 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,063 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:57,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-04-11 17:27:57,064 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,074 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:57,077 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:57,077 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 19 treesize of output 15 [2018-04-11 17:27:57,078 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,091 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 1 [2018-04-11 17:27:57,091 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,101 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:57,105 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:57,105 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 19 treesize of output 15 [2018-04-11 17:27:57,105 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,118 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 1 [2018-04-11 17:27:57,119 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,129 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:57,132 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:57,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 17:27:57,133 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,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, 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 1 [2018-04-11 17:27:57,148 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,159 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-04-11 17:27:57,163 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:27:57,163 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 19 treesize of output 15 [2018-04-11 17:27:57,163 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 17:27:57,177 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,187 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:27:57,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2018-04-11 17:27:57,377 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 7 variables, input treesize:303, output treesize:541 [2018-04-11 17:27:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:27:57,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:27:57,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 17:27:57,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 17:27:57,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 17:27:57,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2018-04-11 17:27:57,583 INFO L87 Difference]: Start difference. First operand 281 states and 311 transitions. Second operand 30 states. [2018-04-11 17:28:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:28:00,682 INFO L93 Difference]: Finished difference Result 366 states and 403 transitions. [2018-04-11 17:28:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 17:28:00,682 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 81 [2018-04-11 17:28:00,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:28:00,683 INFO L225 Difference]: With dead ends: 366 [2018-04-11 17:28:00,683 INFO L226 Difference]: Without dead ends: 366 [2018-04-11 17:28:00,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=354, Invalid=2616, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 17:28:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-04-11 17:28:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 286. [2018-04-11 17:28:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-04-11 17:28:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 316 transitions. [2018-04-11 17:28:00,685 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 316 transitions. Word has length 81 [2018-04-11 17:28:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:28:00,685 INFO L459 AbstractCegarLoop]: Abstraction has 286 states and 316 transitions. [2018-04-11 17:28:00,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 17:28:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 316 transitions. [2018-04-11 17:28:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-11 17:28:00,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:28:00,686 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:28:00,686 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:28:00,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1148477775, now seen corresponding path program 2 times [2018-04-11 17:28:00,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:28:00,686 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:28:00,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:28:00,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:28:00,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:28:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:28:00,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:28:00,696 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:28:00,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:28:00,696 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:28:00,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:28:00,711 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:28:00,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:28:00,714 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:28:00,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:28:00,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:28:00,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:28:00,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-04-11 17:28:00,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:00,765 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 12 treesize of output 15 [2018-04-11 17:28:00,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:55 [2018-04-11 17:28:00,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:28:00,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:00,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:28:00,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:00,833 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:85 [2018-04-11 17:28:00,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:28:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:28:00,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:72 [2018-04-11 17:28:00,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:00,958 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 15 treesize of output 8 [2018-04-11 17:28:00,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:00,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:97, output treesize:83 [2018-04-11 17:28:01,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:01,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:01,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 88 [2018-04-11 17:28:01,035 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 26 treesize of output 26 [2018-04-11 17:28:01,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:01,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:01,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:01,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:106 [2018-04-11 17:28:01,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:01,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:01,392 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 85 [2018-04-11 17:28:01,406 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 73 [2018-04-11 17:28:01,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 8 xjuncts. [2018-04-11 17:28:01,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-04-11 17:28:01,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:01,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:01,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 65 [2018-04-11 17:28:01,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:01,477 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 76 treesize of output 69 [2018-04-11 17:28:01,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:28:01,481 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 43 [2018-04-11 17:28:01,481 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:01,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 17:28:01,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-04-11 17:28:01,585 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:125, output treesize:256 [2018-04-11 17:28:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 17:28:02,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:28:02,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 17:28:02,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 17:28:02,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 17:28:02,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=638, Unknown=35, NotChecked=0, Total=756 [2018-04-11 17:28:02,099 INFO L87 Difference]: Start difference. First operand 286 states and 316 transitions. Second operand 28 states. [2018-04-11 17:28:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:28:03,955 INFO L93 Difference]: Finished difference Result 294 states and 323 transitions. [2018-04-11 17:28:03,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 17:28:03,955 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 83 [2018-04-11 17:28:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:28:03,956 INFO L225 Difference]: With dead ends: 294 [2018-04-11 17:28:03,956 INFO L226 Difference]: Without dead ends: 248 [2018-04-11 17:28:03,956 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=167, Invalid=1419, Unknown=54, NotChecked=0, Total=1640 [2018-04-11 17:28:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-11 17:28:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-04-11 17:28:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-11 17:28:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 277 transitions. [2018-04-11 17:28:03,957 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 277 transitions. Word has length 83 [2018-04-11 17:28:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:28:03,957 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 277 transitions. [2018-04-11 17:28:03,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 17:28:03,958 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 277 transitions. [2018-04-11 17:28:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-11 17:28:03,958 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:28:03,958 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:28:03,958 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:28:03,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1257165400, now seen corresponding path program 1 times [2018-04-11 17:28:03,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:28:03,958 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:28:03,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:28:03,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:28:03,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:28:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:28:03,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:28:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-11 17:28:04,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:28:04,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:28:04,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:28:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:28:04,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:28:04,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:28:04,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:28:04,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:04,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:04,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:28:04,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-11 17:28:04,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:28:04,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:04,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,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 13 treesize of output 10 [2018-04-11 17:28:04,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 10 treesize of output 9 [2018-04-11 17:28:04,213 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-11 17:28:04,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:04,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:04,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:04,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 17:28:04,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:58 [2018-04-11 17:28:04,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:04,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:04,368 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 43 treesize of output 55 [2018-04-11 17:28:04,369 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 22 treesize of output 18 [2018-04-11 17:28:04,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:04,387 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 32 treesize of output 39 [2018-04-11 17:28:04,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:28:04,389 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:60 [2018-04-11 17:28:04,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:04,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:04,431 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 54 treesize of output 47 [2018-04-11 17:28:04,436 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2018-04-11 17:28:04,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 17:28:04,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,445 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:78, output treesize:26 [2018-04-11 17:28:04,485 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 32 treesize of output 33 [2018-04-11 17:28:04,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:04,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22 [2018-04-11 17:28:04,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 17:28:04,552 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:04,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 17:28:04,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:04,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-04-11 17:28:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 17:28:04,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:28:04,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 35 [2018-04-11 17:28:04,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 17:28:04,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 17:28:04,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 17:28:04,605 INFO L87 Difference]: Start difference. First operand 248 states and 277 transitions. Second operand 35 states. [2018-04-11 17:28:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:28:06,211 INFO L93 Difference]: Finished difference Result 312 states and 331 transitions. [2018-04-11 17:28:06,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 17:28:06,211 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 83 [2018-04-11 17:28:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:28:06,212 INFO L225 Difference]: With dead ends: 312 [2018-04-11 17:28:06,212 INFO L226 Difference]: Without dead ends: 312 [2018-04-11 17:28:06,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1061, Invalid=5581, Unknown=0, NotChecked=0, Total=6642 [2018-04-11 17:28:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-11 17:28:06,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 248. [2018-04-11 17:28:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-11 17:28:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 276 transitions. [2018-04-11 17:28:06,214 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 276 transitions. Word has length 83 [2018-04-11 17:28:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:28:06,215 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 276 transitions. [2018-04-11 17:28:06,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 17:28:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 276 transitions. [2018-04-11 17:28:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 17:28:06,215 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:28:06,215 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:28:06,215 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:28:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1250191115, now seen corresponding path program 3 times [2018-04-11 17:28:06,215 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:28:06,215 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:28:06,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:28:06,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:28:06,216 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:28:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:28:06,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:28:06,239 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:28:06,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:28:06,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:28:06,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:28:06,267 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 17:28:06,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:28:06,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:28:06,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:28:06,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:28:06,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:06,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:06,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:28:06,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-11 17:28:06,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:28:06,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:06,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:28:06,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:06,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:37 [2018-04-11 17:28:06,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:06,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:06,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:28:06,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:06,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:52 [2018-04-11 17:28:06,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:06,421 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 23 treesize of output 30 [2018-04-11 17:28:06,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:28:06,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:06,442 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 48 treesize of output 49 [2018-04-11 17:28:06,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:06,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:06,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:78, output treesize:64 [2018-04-11 17:28:06,481 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 59 treesize of output 40 [2018-04-11 17:28:06,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-04-11 17:28:06,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,486 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 25 treesize of output 10 [2018-04-11 17:28:06,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:06,494 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:82, output treesize:33 [2018-04-11 17:28:06,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:28:06,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:06,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2018-04-11 17:28:06,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 17:28:06,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:06,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:06,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:19 [2018-04-11 17:28:06,668 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-04-11 17:28:06,669 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:06,670 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 22 treesize of output 14 [2018-04-11 17:28:06,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:06,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-04-11 17:28:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-11 17:28:06,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:28:06,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 17:28:06,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 17:28:06,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 17:28:06,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2018-04-11 17:28:06,740 INFO L87 Difference]: Start difference. First operand 248 states and 276 transitions. Second operand 26 states. [2018-04-11 17:28:07,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:28:07,846 INFO L93 Difference]: Finished difference Result 283 states and 305 transitions. [2018-04-11 17:28:07,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 17:28:07,846 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 85 [2018-04-11 17:28:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:28:07,847 INFO L225 Difference]: With dead ends: 283 [2018-04-11 17:28:07,847 INFO L226 Difference]: Without dead ends: 283 [2018-04-11 17:28:07,847 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=476, Invalid=2604, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 17:28:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-11 17:28:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 246. [2018-04-11 17:28:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-04-11 17:28:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 274 transitions. [2018-04-11 17:28:07,848 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 274 transitions. Word has length 85 [2018-04-11 17:28:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:28:07,849 INFO L459 AbstractCegarLoop]: Abstraction has 246 states and 274 transitions. [2018-04-11 17:28:07,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 17:28:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 274 transitions. [2018-04-11 17:28:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 17:28:07,849 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:28:07,849 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-04-11 17:28:07,849 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:28:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash -70287254, now seen corresponding path program 6 times [2018-04-11 17:28:07,850 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:28:07,850 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:28:07,850 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:28:07,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:28:07,850 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:28:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:28:07,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:28:07,907 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:28:07,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:28:07,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:28:07,908 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 17:28:07,933 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-11 17:28:07,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:28:07,936 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:28:07,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:28:07,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:07,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:07,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:28:07,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:28:07,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:07,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:07,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:07,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:28:07,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:07,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:07,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-11 17:28:08,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:28:08,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:08,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:28:08,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:08,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:56 [2018-04-11 17:28:08,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 17:28:08,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-11 17:28:08,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:71 [2018-04-11 17:28:08,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,156 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 54 treesize of output 66 [2018-04-11 17:28:08,158 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 22 treesize of output 18 [2018-04-11 17:28:08,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,181 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 32 treesize of output 39 [2018-04-11 17:28:08,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:28:08,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:79 [2018-04-11 17:28:08,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,285 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 41 treesize of output 100 [2018-04-11 17:28:08,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 88 [2018-04-11 17:28:08,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:164 [2018-04-11 17:28:08,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-04-11 17:28:08,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,419 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 89 treesize of output 90 [2018-04-11 17:28:08,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:08,421 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,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, 8 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 143 [2018-04-11 17:28:08,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-04-11 17:28:08,456 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,482 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:199, output treesize:124 [2018-04-11 17:28:08,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 32 [2018-04-11 17:28:08,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-11 17:28:08,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:08,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:300, output treesize:272 [2018-04-11 17:28:08,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:08,687 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 219 treesize of output 200 [2018-04-11 17:28:08,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 132 [2018-04-11 17:28:08,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-11 17:28:08,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:08,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:08,722 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:241, output treesize:145 [2018-04-11 17:28:09,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:09,070 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:09,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:09,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:09,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:09,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:09,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:09,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 146 [2018-04-11 17:28:09,083 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:09,096 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 83 [2018-04-11 17:28:09,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-04-11 17:28:09,191 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:09,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 79 [2018-04-11 17:28:09,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:28:09,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:09,198 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 71 treesize of output 59 [2018-04-11 17:28:09,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:09,200 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:09,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 67 [2018-04-11 17:28:09,204 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:28:09,207 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:09,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 73 [2018-04-11 17:28:09,211 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 17:28:09,213 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:09,213 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 65 treesize of output 53 [2018-04-11 17:28:09,213 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:09,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:09,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:09,216 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:09,217 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 83 treesize of output 81 [2018-04-11 17:28:09,217 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:09,220 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:09,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 77 [2018-04-11 17:28:09,224 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 17:28:09,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2018-04-11 17:28:09,360 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:09,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:09,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-04-11 17:28:09,363 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:09,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 76 [2018-04-11 17:28:09,368 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:09,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2018-04-11 17:28:09,373 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:09,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 78 [2018-04-11 17:28:09,378 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:09,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2018-04-11 17:28:09,380 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:09,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2018-04-11 17:28:09,381 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:09,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2018-04-11 17:28:09,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 44 dim-0 vars, and 11 xjuncts. [2018-04-11 17:28:09,754 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:191, output treesize:606 [2018-04-11 17:28:10,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:10,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:10,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-04-11 17:28:10,045 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 31 [2018-04-11 17:28:10,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-04-11 17:28:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:28:10,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:10,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:28:10,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:10,076 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:75 [2018-04-11 17:28:10,257 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 11 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:28:10,257 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:28:10,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-11 17:28:10,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 17:28:10,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 17:28:10,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1168, Unknown=1, NotChecked=0, Total=1260 [2018-04-11 17:28:10,257 INFO L87 Difference]: Start difference. First operand 246 states and 274 transitions. Second operand 36 states. [2018-04-11 17:28:13,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:28:13,230 INFO L93 Difference]: Finished difference Result 260 states and 277 transitions. [2018-04-11 17:28:13,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 17:28:13,230 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 85 [2018-04-11 17:28:13,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:28:13,230 INFO L225 Difference]: With dead ends: 260 [2018-04-11 17:28:13,231 INFO L226 Difference]: Without dead ends: 256 [2018-04-11 17:28:13,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=434, Invalid=4395, Unknown=1, NotChecked=0, Total=4830 [2018-04-11 17:28:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-04-11 17:28:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 226. [2018-04-11 17:28:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-11 17:28:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 243 transitions. [2018-04-11 17:28:13,232 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 243 transitions. Word has length 85 [2018-04-11 17:28:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:28:13,232 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 243 transitions. [2018-04-11 17:28:13,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 17:28:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 243 transitions. [2018-04-11 17:28:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 17:28:13,233 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:28:13,233 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2018-04-11 17:28:13,233 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr25AssertViolationMEMORY_FREE, mainErr26EnsuresViolationMEMORY_LEAK, mainErr18RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr22AssertViolationMEMORY_FREE, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-11 17:28:13,233 INFO L82 PathProgramCache]: Analyzing trace with hash 38104253, now seen corresponding path program 3 times [2018-04-11 17:28:13,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:28:13,233 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:28:13,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:28:13,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:28:13,233 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:28:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:28:13,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:28:13,243 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:28:13,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:28:13,244 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:28:13,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:28:13,262 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-11 17:28:13,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:28:13,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:28:13,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:28:13,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:28:13,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:28:13,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 17:28:13,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:28:13,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:13,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-11 17:28:13,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:28:13,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-04-11 17:28:13,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-04-11 17:28:13,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:28:13,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-04-11 17:28:13,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:28:13,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:13,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:50 [2018-04-11 17:28:13,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,541 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 55 treesize of output 66 [2018-04-11 17:28:13,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-04-11 17:28:13,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 46 [2018-04-11 17:28:13,574 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:28:13,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:28:13,606 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 2 xjuncts. [2018-04-11 17:28:13,606 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:63, output treesize:91 [2018-04-11 17:28:13,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,747 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 99 treesize of output 139 [2018-04-11 17:28:13,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,772 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 115 treesize of output 136 [2018-04-11 17:28:13,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,798 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 71 treesize of output 86 [2018-04-11 17:28:13,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:13,826 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 70 treesize of output 98 [2018-04-11 17:28:13,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:13,858 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:171, output treesize:195 [2018-04-11 17:28:13,960 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 185 treesize of output 135 [2018-04-11 17:28:13,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:13,962 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 133 treesize of output 95 [2018-04-11 17:28:13,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:14,022 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 98 [2018-04-11 17:28:14,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:14,120 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 80 treesize of output 79 [2018-04-11 17:28:14,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:14,182 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:14,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 80 [2018-04-11 17:28:14,183 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:14,253 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 61 treesize of output 80 [2018-04-11 17:28:14,254 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-11 17:28:14,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 17:28:14,396 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 130 [2018-04-11 17:28:14,397 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 17:28:14,409 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 17:28:14,409 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:14,819 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:14,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 120 [2018-04-11 17:28:14,821 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:15,091 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 114 treesize of output 113 [2018-04-11 17:28:15,091 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:15,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 96 [2018-04-11 17:28:15,506 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-11 17:28:15,709 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 91 treesize of output 125 [2018-04-11 17:28:15,709 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-11 17:28:15,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 88 [2018-04-11 17:28:15,876 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:15,900 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:16,169 INFO L267 ElimStorePlain]: Start of recursive call 9: 6 dim-0 vars, 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-04-11 17:28:16,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 38 dim-0 vars, and 13 xjuncts. [2018-04-11 17:28:16,363 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:319, output treesize:1230 [2018-04-11 17:28:17,688 WARN L151 SmtUtils]: Spent 1210ms on a formula simplification. DAG size of input: 308 DAG size of output 92 [2018-04-11 17:28:18,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 116 [2018-04-11 17:28:18,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:18,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:18,448 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:18,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 106 [2018-04-11 17:28:18,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 10 xjuncts. [2018-04-11 17:28:18,936 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 93 treesize of output 88 [2018-04-11 17:28:18,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:19,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2018-04-11 17:28:19,414 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:19,897 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 73 treesize of output 72 [2018-04-11 17:28:19,898 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:20,427 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 70 [2018-04-11 17:28:20,428 INFO L267 ElimStorePlain]: Start of recursive call 7: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 17:28:20,435 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 76 [2018-04-11 17:28:20,436 INFO L267 ElimStorePlain]: Start of recursive call 8: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 17:28:21,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 87 [2018-04-11 17:28:21,071 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:21,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 87 [2018-04-11 17:28:21,745 INFO L267 ElimStorePlain]: Start of recursive call 10: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 17:28:22,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:22,450 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:22,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 100 [2018-04-11 17:28:22,470 INFO L267 ElimStorePlain]: Start of recursive call 11: 20 dim-0 vars, End of recursive call: 20 dim-0 vars, and 16 xjuncts. [2018-04-11 17:28:23,630 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 65 treesize of output 64 [2018-04-11 17:28:23,631 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:23,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 64 [2018-04-11 17:28:23,639 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:24,879 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 80 treesize of output 68 [2018-04-11 17:28:24,880 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:26,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 87 [2018-04-11 17:28:26,087 INFO L267 ElimStorePlain]: Start of recursive call 15: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-11 17:28:27,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2018-04-11 17:28:27,355 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:27,359 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 69 treesize of output 68 [2018-04-11 17:28:27,359 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:27,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 64 [2018-04-11 17:28:27,364 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:28,767 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:28,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 50 [2018-04-11 17:28:28,771 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:30,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-11 17:28:30,216 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:30,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-04-11 17:28:30,217 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:31,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 77 [2018-04-11 17:28:31,655 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:33,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2018-04-11 17:28:33,086 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:34,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2018-04-11 17:28:34,519 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:35,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2018-04-11 17:28:35,954 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:37,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 84 [2018-04-11 17:28:37,404 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:38,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, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 54 [2018-04-11 17:28:38,845 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:38,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2018-04-11 17:28:38,879 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:40,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2018-04-11 17:28:40,311 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:40,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2018-04-11 17:28:40,312 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:40,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2018-04-11 17:28:40,313 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:40,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2018-04-11 17:28:40,314 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:41,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:41,837 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:41,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 100 [2018-04-11 17:28:41,857 INFO L267 ElimStorePlain]: Start of recursive call 33: 20 dim-0 vars, End of recursive call: 20 dim-0 vars, and 16 xjuncts. [2018-04-11 17:28:44,075 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 81 [2018-04-11 17:28:44,076 INFO L267 ElimStorePlain]: Start of recursive call 34: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:46,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 72 [2018-04-11 17:28:46,251 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:46,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 64 [2018-04-11 17:28:46,256 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:46,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2018-04-11 17:28:46,262 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:48,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2018-04-11 17:28:48,596 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:28:50,831 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 65 treesize of output 64 [2018-04-11 17:28:50,832 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:50,836 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 69 treesize of output 68 [2018-04-11 17:28:50,837 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:28:53,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:53,205 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:53,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 100 [2018-04-11 17:28:53,222 INFO L267 ElimStorePlain]: Start of recursive call 41: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 10 xjuncts. [2018-04-11 17:28:56,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:28:56,053 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:28:56,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 76 [2018-04-11 17:28:56,062 INFO L267 ElimStorePlain]: Start of recursive call 42: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 17:28:58,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-04-11 17:28:58,964 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:58,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-04-11 17:28:58,966 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-11 17:28:58,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2018-04-11 17:28:58,967 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-11 17:29:01,975 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:29:01,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2018-04-11 17:29:01,982 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:29:04,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 62 [2018-04-11 17:29:04,905 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:29:04,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2018-04-11 17:29:04,906 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:29:07,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:29:07,656 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:29:07,663 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 3 case distinctions, treesize of input 80 treesize of output 92 [2018-04-11 17:29:07,664 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 17:29:10,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-04-11 17:29:10,493 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-11 17:29:10,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2018-04-11 17:29:10,496 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-11 17:29:13,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2018-04-11 17:29:13,378 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:29:13,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-04-11 17:29:13,379 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:29:13,380 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 40 [2018-04-11 17:29:13,380 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. Received shutdown request... [2018-04-11 17:29:14,965 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 17:29:14,965 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 17:29:14,968 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 17:29:14,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 05:29:14 BoogieIcfgContainer [2018-04-11 17:29:14,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 17:29:14,969 INFO L168 Benchmark]: Toolchain (without parser) took 181680.83 ms. Allocated memory was 401.6 MB in the beginning and 551.0 MB in the end (delta: 149.4 MB). Free memory was 336.2 MB in the beginning and 462.5 MB in the end (delta: -126.3 MB). Peak memory consumption was 337.8 MB. Max. memory is 5.3 GB. [2018-04-11 17:29:14,969 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 401.6 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 17:29:14,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.78 ms. Allocated memory is still 401.6 MB. Free memory was 332.2 MB in the beginning and 307.0 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-11 17:29:14,970 INFO L168 Benchmark]: Boogie Preprocessor took 43.31 ms. Allocated memory is still 401.6 MB. Free memory was 307.0 MB in the beginning and 305.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 17:29:14,970 INFO L168 Benchmark]: RCFGBuilder took 410.14 ms. Allocated memory was 401.6 MB in the beginning and 583.0 MB in the end (delta: 181.4 MB). Free memory was 304.3 MB in the beginning and 514.2 MB in the end (delta: -209.8 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-11 17:29:14,970 INFO L168 Benchmark]: TraceAbstraction took 180986.62 ms. Allocated memory was 583.0 MB in the beginning and 551.0 MB in the end (delta: -32.0 MB). Free memory was 514.2 MB in the beginning and 462.5 MB in the end (delta: 51.7 MB). Peak memory consumption was 334.4 MB. Max. memory is 5.3 GB. [2018-04-11 17:29:14,971 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.14 ms. Allocated memory is still 401.6 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.78 ms. Allocated memory is still 401.6 MB. Free memory was 332.2 MB in the beginning and 307.0 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.31 ms. Allocated memory is still 401.6 MB. Free memory was 307.0 MB in the beginning and 305.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 410.14 ms. Allocated memory was 401.6 MB in the beginning and 583.0 MB in the end (delta: 181.4 MB). Free memory was 304.3 MB in the beginning and 514.2 MB in the end (delta: -209.8 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 180986.62 ms. Allocated memory was 583.0 MB in the beginning and 551.0 MB in the end (delta: -32.0 MB). Free memory was 514.2 MB in the beginning and 462.5 MB in the end (delta: 51.7 MB). Peak memory consumption was 334.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 626]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - TimeoutResultAtElement [Line: 655]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 86 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 933. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 87 locations, 27 error locations. TIMEOUT Result, 180.9s OverallTime, 56 OverallIterations, 5 TraceHistogramMax, 79.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3319 SDtfs, 19344 SDslu, 32774 SDs, 0 SdLazy, 40940 SolverSat, 2722 SolverUnsat, 131 SolverUnknown, 0 SolverNotchecked, 44.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3889 GetRequests, 1896 SyntacticMatches, 37 SemanticMatches, 1956 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 19144 ImplicationChecksByTransitivity, 50.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=51, 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.1s AutomataMinimizationTime, 55 MinimizatonAttempts, 2182 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 37.9s InterpolantComputationTime, 5913 NumberOfCodeBlocks, 5892 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 3438 ConstructedInterpolants, 1164 QuantifiedInterpolants, 11831806 SizeOfPredicates, 969 NumberOfNonLiveVariables, 10344 ConjunctsInSsa, 2431 ConjunctsInUnsatCore, 63 InterpolantComputations, 12 PerfectInterpolantSequences, 251/1811 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_17-29-14-975.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/alternating_list_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_17-29-14-975.csv Completed graceful shutdown